Results 1 to 10 of about 1,024,280 (205)
QKD parameter estimation by two-universal hashing [PDF]
Quantum, 2023 This paper proposes and proves security of a QKD protocol which uses two-universal hashing instead of random sampling to estimate the number of bit flip and phase flip errors.
Dimiter Ostrev
doaj +3 more sources
Multimixer-128: Universal Keyed Hashing Based on Integer Multiplication
IACR Transactions on Symmetric Cryptology, 2023 In this paper we introduce a new keyed hash function based on 32-bit integer multiplication that we call Multimixer-128. In our approach, we follow the key-then-hash parallel paradigm. So, we first add a variable length input message to a secret key and
Koustabh Ghosh +2 more
doaj +2 more sources
Strongly universal string hashing is fast [PDF]
The Computer Journal, 2014 We present fast strongly universal string hashing families: they can process data at a rate of 0.2 CPU cycle per byte. Maybe surprisingly, we find that these families---though they require a large buffer of random numbers---are often faster than popular ...
Kaser, Owen, Lemire, Daniel
core +5 more sources
Universal hash functions from quantum procedures
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 Modern quantum technologies are NISQ (Noisy Intermediate-Scale Quantum) devices, which are used to create insufficiently accurate quantum computers with low computing power.
F.M. Ablayev, M.T. Ziatdinov
doaj +2 more sources
Universal Hashing for Information-Theoretic Security [PDF]
Proceedings of the IEEE, 2014 Corrected an error in the proof of Lemma ...
Himanshu Tyagi, A. Vardy
semanticscholar +4 more sources
Faster 64-bit universal hashing using carry-less multiplications [PDF]
Journal of Cryptographic Engineering, 2015 Intel and AMD support the Carry-less Multiplication (CLMUL) instruction set in their x64 processors. We use CLMUL to implement an almost universal 64-bit hash family (CLHASH).
Kaser, Owen, Lemire, Daniel
core +3 more sources
Chip-integrated quantum signature network over 200 km [PDF]
Light: Science & ApplicationsThe development of quantum networks is paramount towards practical and secure communications. Quantum digital signatures (QDS) offer an information-theoretically secure solution for ensuring data integrity, authenticity, and non-repudiation, rapidly ...
Yongqiang Du +9 more
doaj +2 more sources
Fractional hitting sets for efficient multiset sketching [PDF]
Algorithms for Molecular BiologyThe exponential increase in publicly available sequencing data and genomic resources necessitates the development of highly efficient methods for data processing and analysis.
Timothé Rouzé +3 more
doaj +2 more sources
Universal Hashing and Multiple Authentication [PDF]
Annual International Cryptology Conference, 1996 In this paper, we study unconditionally secure codes that provide authentication without secrecy. Our point of view is the universal hashing approach pioneered by Wegman and Carter in 1981. We first compare several recent universal-hashing based constructions for authentication codes.
M. Atici, Douglas R Stinson
semanticscholar +2 more sources
The computational complexity of universal hashing
Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90, 1990 Summary form only given. Any implementation of Carter-Wegman universal hashing from n-b strings to m-b strings requires a time-space tradeoff of TS= Omega (nm).
Y. Mansour, N. Nisan, Prasoon Tiwari
semanticscholar +2 more sources