268 search results - page 4 / 54 » An Analysis of Bitstate Hashing |
HOTOS
2003
IEEE
14 years 9 days ago
2003
IEEE
Recent research has produced a new and perhaps dangerous technique for uniquely identifying blocks that I will call compare-by-hash. Using this technique, we decide whether two bl...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
FSE
2006
Springer
13 years 10 months ago
2006
Springer
The security of hash functions has recently become one of the hottest topics in the design and analysis of cryptographic primitives. Since almost all the hash functions used today ...
CRYPTO
2011
Springer
12 years 6 months ago
2011
Springer
We prove that Tandem-DM, one of the two “classical” schemes for turning a blockcipher of 2n-bit key into a double block length hash function, has birthday-type collision resist...
CHES
2011
Springer
12 years 7 months ago
2011
Springer
This paper proposes spongent – a family of lightweight hash functions with hash sizes of 88 (for preimage resistance only), 128, 160, 224, and 256 bits based on a sponge construc...