109 search results - page 9 / 22 » Analysis of All-or-Nothing Hash Functions |
123
click to vote
ACISP
2008
Springer
15 years 10 months ago
2008
Springer
LAKE is a family of cryptographic hash functions presented at FSE 2008. It is an iterated hash function and defines two main instances with a 256 bit and 512 bit hash value. In th...
141
click to vote
HPCA
2004
IEEE
16 years 4 months ago
2004
IEEE
Using alternative cache indexing/hashing functions is a popular technique to reduce conflict misses by achieving a more uniform cache access distribution across the sets in the ca...
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
110
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
132
click to vote
CCS
2008
ACM
15 years 6 months ago
2008
ACM
In this paper, we study the security of a practical randomness extractor and its application in the tls standard. Randomness extraction is the first stage of key derivation functi...