9 search results - page 2 / 2 » A Failure-Friendly Design Principle for Hash Functions |
EUROCRYPT
2004
Springer
14 years 25 days ago
2004
Springer
Textbooks tell us that a birthday attack on a hash function h with range size r requires r1/2 trials (hash computations) to find a collision. But this is quite misleading, being t...
ISW
2009
Springer
14 years 2 months ago
2009
Springer
The recently started SHA-3 competition in order to find a new secure hash standard and thus a replacement for SHA-1/SHA-2 has attracted a lot of interest in the academic world as ...
AC
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. This paper examines proposals for three cryptographic primitives: block ciphers, stream ciphers, and hash functions. It provides an overview of the design principles of a...
ACNS
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we present a pseudo-collision attack on the compression function of all Twister variants (224,256,384,512) with complexity of about 226.5 compression function evalua...