Results 51 to 60 of about 10,388,112 (269)
Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence
, 2013 Simple tabulation dates back to Zobrist in 1970. Keys are viewed as c characters from some alphabet A. We initialize c tables h_0, ..., h_{c-1} mapping characters to random hash values.
Thorup, Mikkel
core +1 more source
One-way hash function with chaotic dynamic parameters
Tongxin xuebao, 2008 A novel keyed one-way hash function based on chaotic dynamic parameters was presented which combines the advantage of both chaotic system and conventional one-way hash function.In the proposed approach the fixed parameters of conventional hash function ...
GUO Wei1 +3 more
doaj +2 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
Comparison of hash function algorithms against attacks: A review
, 2018 Hash functions are considered key components of nearly all cryptographic protocols, as well as of many security applications such as message authentication codes, data integrity, password storage, and random number generation.
Ali Maetouq +5 more
semanticscholar +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
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
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
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