Results 1 to 10 of about 1,098,148 (248)
Regular and almost universal hashing: an efficient implementation [PDF]
Software: Practice and Experience, 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 ...
Ignatchenko, Sergey +2 more
core +10 more sources
The universality of iterated hashing over variable-length strings [PDF]
Discrete Applied Mathematics, 2011 Iterated hash functions process strings recursively, one character at a time. At each iteration, they compute a new hash value from the preceding hash value and the next character.
Byers +20 more
core +7 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 +5 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 +4 more sources
Universal Hashing for Information Theoretic Security [PDF]
Proceedings of the IEEE, 2016 The information theoretic approach to security entails harnessing the correlated randomness available in nature to establish security. It uses tools from information theory and coding and yields provable security, even against an adversary with unbounded
Tyagi, Himanshu, Vardy, Alexander
core +6 more sources
Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters [PDF]
Symposium on the Theory of ComputingOrthogonal arrays are a type of combinatorial design that emerged in the 1940s in the design of statistical experiments. In 1947, Rao proved a lower bound on the size of any orthogonal array, and raised the problem of constructing arrays of minimum size.
Nicholas J. A. Harvey, Arvin Sahami
openalex +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
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
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
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing [PDF]
Theory of Computing, 2021 This paper uses a variant of the notion of inaccessible entropy (Haitner, Reingold, Vadhan and Wee, STOC 2009), to give an alternative construction and proof for the fundamental result, first proved by Rompel (STOC 1990), that Universal One-Way Hash ...
Iftach Haitner +4 more
openalex +3 more sources