Results 141 to 150 of about 983,384 (170)
Some of the next articles are maybe not open access.
Analysis of a universal class of hash functions
1978In this paper we use linear algebraic methods to analyze the performance of several classes of hash functions, including the class H2 presented by Carter and Wegman [2]. Suppose H is a suitable class, the hash functions in H map A to B, S is any subset of A whose size is equal to that of B, and x is any element of A.
George Markowsky +2 more
openaire +2 more sources
Universal Hash-Function Families: From Hashing to Authentication
2014Due to their potential use as building blocks for constructing highly efficient message authentication codes (MACs), universal hash-function families have been attracting increasing research attention, both from the design and analysis points of view.
openaire +2 more sources
Efficient Strongly Universal and Optimally Universal Hashing
1999New hash families are analyzed, mainly consisting of the hash functions ha,b : {0,..., u - 1} → {0,..., r - 1}, x → ((ax + b) mod(kr)) div k. Universal classes of such functions have already been investigated in [5, 6], and used in severail applications, e.g. [3,9].
openaire +1 more source
A new universal class of hash functions and dynamic hashing in real time
2005The paper presents a new universal class of hash functions which have many desirable features of random functions, but can be (probabilistically) constructed using sublinear time and space, and can be evaluated in constant time.
Martin Dietzfelbinger +1 more
openaire +1 more source
A caution on universal classes of hash functions
Information Processing Letters, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
On the Universal Hash Functions in Luby-Rackoff Cipher
2003It is known that a super-pseudorandom permutation on 2n bits can be obtained from a random function f on n bits and two bisymmetric and AXU hash functions h1 and h2 on n bits. It has a Feistel type structure which is usually denoted by φ(h1, f, f, h2).
Tetsu Iwata, Kaoru Kurosawa
openaire +2 more sources
Universal classes of hash functions (Extended Abstract)
Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77, 1977This 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 ...
Larry Carter, Mark N. Wegman
openaire +1 more source
A new multi-linear universal hash family
Designs, Codes and Cryptography, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the program size of perfect and universal hash functions
23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), 1982We address the question of program size of of perfect and universal hash functions. We prove matching upper and lower bounds (up to constant factors) on program size. Furthermore, we show that minimum or nearly minimum size programs can be found efficiently.
openaire +2 more sources