Results 211 to 220 of about 1,105,353 (251)
Some of the next articles are maybe not open access.
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
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 +2 more sources
A caution on universal classes of hash functions
Information Processing Letters, 1991Abstract Universal classes of hash functions of the form ((A × Key + B) mod P) mod Size, where A, B, and P (a prime greater than A and B) are constants and Size is the number of hash addresses, have come into common use. Theory and practical tests have shown that for random choices of the constants, excellent performance is to be expected. This paper
openaire +2 more sources
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
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 +1 more source
Efficient Unconditionally Secure Signatures Using Universal Hashing
International Conference on Applied Cryptography and Network Security, 2018R. Amiri +3 more
semanticscholar +1 more source
A new multi-linear universal hash family
Designs, Codes and Cryptography, 2012A new universal hash family is described which generalises a previously known multi-linear hash family. Messages are sequences over a finite field $${\mathbb{F}_q}$$ while keys are sequences over an extension field $${\mathbb{F}_{q^n}}$$ . A linear map $${\psi}$$ from $${\mathbb{F}_{q^n}}$$ to itself is used to compute the output digest.
openaire +2 more sources
Universal Hashing via Integer Arithmetic Without Primes, Revisited
Adventures Between Lower Bounds and Higher Altitudes, 2018Martin Dietzfelbinger
semanticscholar +1 more source
The Multi-user Security of MACs via Universal Hashing in the Ideal Cipher Model
The Cryptographer's Track at RSA ConferenceYusuke Naito
semanticscholar +1 more source