Results 11 to 20 of about 914,695 (232)
Universal Hashing for Information-Theoretic Security [PDF]
Proceedings of the IEEE, 2015 Corrected an error in the proof of Lemma ...
Tyagi, Himanshu, Vardy, Alexander
openaire +5 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 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
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
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 +3 more sources
Universal classes of hash functions
Journal of Computer and System Sciences, 1979 AbstractThis paper gives an input independent average linear time algorithm for storage and retrieval on keys. The algorithm makes a random choice of hash function from a suitable class of hash functions. Given any sequence of inputs the expected time (averaging over all functions in the class) to store and retrieve elements is linear in the length of ...
J.Lawrence Carter, Mark N. Wegman
openalex +3 more sources
Hashing practice: analysis of hashing and universal hashing
ACM SIGMOD Record, 1988 Much of the literature on hashing deals with overflow handling (collision resolution) techniques and its analysis. What does all the analytical results mean in practice and how can they be achieved with practical files? This paper considers the problem of achieving analytical performance of hashing techniques in practice with reference to successful ...
M. Ramakrishna
openalex +3 more sources
Hash Property and Fixed-Rate Universal Coding Theorems [PDF]
IEEE Transactions on Information Theory, 2010 submitted to IEEE Transactions on Information Theory, Mar. 2008.
Jun Muramatsu, Shigeki Miyake
openalex +5 more sources
Universal classes of hash functions (Extended Abstract) [PDF]
Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77, 1977 This paper gives an input independent average linear time algorithm for storage and retrieval on keys. The algorithm makes a random choice of hash function from a suitable class of hash functions. Given any sequence of inputs the expected time (averaging over all functions in the class) to store and retrieve elements is linear in the length of the ...
J. Lawrence Carter, Mark N. Wegman
openalex +3 more sources
An Ordered Universal Accumulator Based on a Hash Chain
Applied SciencesCryptographic accumulators are now fundamental for secure applications across blockchain, IoT, and big data, powering anonymous credentials, streamlining key management, and enabling efficient data filtering. However, existing accumulator methods, like RSA, bilinear pairing, and Merkle trees, are hampered by storage bloat, computational burdens, and ...
Wenbao Jiang +3 more
openalex +3 more sources