Results 21 to 30 of about 123,105 (127)
The Usefulness of Multilevel Hash Tables with Multiple Hash Functions in Large Databases [PDF]
, 2009 In this work, attempt is made to select three good hash functions which uniformly distribute hash values that permute their internal states and allow the input bits to generate different output bits.
Akinwale, A. T., Ibharalu, F. T.
core +1 more source
Leftover Hashing Against Quantum Side Information
, 2010 The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random.
Renner, Renato +3 more
core +1 more source
Annales UMCS, Informatica, 2012 In this paper we describe a family of highly parameterized hash functions. This parameterization results in great flexibility between performance and security of the algorithm. The three basic functions, HaF-256, HaF-512 and HaF-1024 constitute this hash function family. Lengths of message digests are 256, 512 and 1024 bits respectively.
Krzysztof Bucholc +3 more
openaire +3 more sources
Key recycling in authentication
, 2014 In their seminal work on authentication, Wegman and Carter propose that to authenticate multiple messages, it is sufficient to reuse the same hash function as long as each tag is encrypted with a one-time pad.
Portmann, Christopher
core +1 more source
Joux multicollisions attack in sponge construction [PDF]
, 2013 Cryptographic hash functions take an unfixed size of input and produce a fixed size of an output. A hash function usually has two main components: a compression function and mode of operation.
AlAhmad, Mohammad A. +2 more
core +1 more source
ACM Journal of Experimental Algorithmics, 1997 In this paper an efficient open address hash function called exponential hashing is developed. The motivation for this hash function resulted from our ongoing efforts to apply dynamical systems theory to the study of hashing; however, the analysis conducted in this paper is primarily based on traditional number theory. Proofs of optimal table parameter
Chaouki T. Abdallah +2 more
openaire +2 more sources
Verifiable Random Functions (VRFs) [PDF]
, 2018 A Verifiable Random Function (VRF) is the public-key version of a keyed cryptographic hash. Only the holder of the private key can compute the hash, but anyone with public key can verify the correctness of the hash.
Goldberg, Sharon +3 more
core
GPERF : a perfect hash function generator [PDF]
, 1992 gperf is a widely available perfect hash function generator written in C++. It automates a common system software operation: keyword recognition. gperf translates an n element user-specified keyword list keyfile into source code containing a k element ...
Schmidt, Douglas C., Suda, Tatsuya
core
The suffix-free-prefix-free hash function construction and its indifferentiability security analysis [PDF]
, 2012 In this paper, we observe that in the seminal work on indifferentiability analysis of iterated hash functions by Coron et al. and in subsequent works, the initial value (IV) of hash functions is fixed.
Erik Zenner +4 more
core +2 more sources