Results 11 to 20 of about 1,394 (186)
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
openaire +2 more sources
Universal Hashing and Geometric Codes [PDF]
Designs, Codes and Cryptography, 1997 A universal class of hash functions is, grosso modo, a collection of hash functions such that a random choice of a function in the set yields a low probability that any two distinct inputs will collide. The concept is due to Carter and Wegman, and has numerous applications. (See the introduction to [\textit{D. R.
Bierbrauer, Jürgen
openaire +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 Atici, Douglas R. Stinson
openaire +3 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
Combinatorial techniques for universal hashing [PDF]
Journal of Computer and System Sciences, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stinson, D.R.
openaire +3 more sources
On Risks of Using Cuckoo Hashing with Simple Universal Hash Classes [PDF]
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009 Cuckoo hashing, introduced by Pagh and Rodler [10], is a dynamic dictionary data structure for storing a set S of n keys from a universe U, with constant lookup time and amortized expected constant insertion time.
Martin Dietzfelbinger, Ulf Schellbach
openaire +3 more sources
The Message Authentication Code Based on Universal Hashing [PDF]
Безопасность информационных технологий, 2012 The article covers the research of message authentication codes based on universal hashing. The new message authentication code algorithm is described here. The analysis of the algorithm is also provided in this article.
T. A. Bilyk, A. U. Nesterenko
doaj +1 more source
Software Performance of Universal Hash Functions [PDF]
, 1999 This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toeplitz hashing, division hashing, evaluation hashing, and MMH hashing. An objective comparison between these widely varying approaches is achieved by defining constructions that offer a ...
Nevelsteen, W., Preneel, Bart
openaire +5 more sources
Invertible Universal Hashing and the TET Encryption Mode [PDF]
, 2007 This work describes a mode of operation, TET, that turns a regular block cipher into a length-preserving enciphering scheme for messages of (almost) arbitrary length. When using an n-bit block cipher, the resulting scheme can handle input of any bit-length between n and 2n and associated data of arbitrary length.
Shai Halevi
openaire +5 more sources
Regular and almost universal hashing: an efficient implementation [PDF]
Software: Practice and Experience, 2016 SummaryRandom 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 same hash value is low given that we pick hash functions at random. However, universality fails
Dmytro Ivanchykhin +2 more
openaire +5 more sources