Results 1 to 10 of about 18,254 (218)
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 +3 more sources
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 +4 more sources
Strongly Universal String Hashing is Fast [PDF]
The Computer Journal, 2013 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 hash functions with weaker theoretical guarantees.
Lemire, Daniel, Kaser, Owen
openaire +5 more sources
A Fast Single-Key Two-Level Universal Hash Function
IACR Transactions on Symmetric Cryptology, 2017 Universal hash functions based on univariate polynomials are well known, e.g. Poly1305 and GHASH. Using Horner’s rule to evaluate such hash functionsrequire l − 1 field multiplications for hashing a message consisting of l blocks where each block is one ...
Debrup Chakraborty +2 more
doaj +2 more sources
The computational complexity of universal hashing [PDF]
Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yishay Mansour +2 more
openalex +2 more sources
Universal Hashing and Multiple Authentication [PDF]
, 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.
Mustafa Atıcı, D. R. Stinson
openalex +2 more sources
Faster 64-bit universal hashing using carry-less multiplications [PDF]
, 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).
Daniel Lemire, Owen Kaser
openalex +4 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
Regular and almost universal hashing: an efficient implementation [PDF]
, 2016 Random hashing can provide guarantees regarding the performance of data structures such as hash tables---even in an adversarial setting. Many existing families of hash functions are universal: given two data objects, the probability that they have the ...
Dmytro Ivanchykhin +2 more
openalex +4 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