19 search results - page 2 / 4 » Design Principles for Dedicated Hash Functions |
IEICET
2008
13 years 5 months ago
2008
In this paper, we introduce new compression function design principles supporting variable output lengths (multiples of size n). They are based on a function or block cipher with a...
ARITH
2005
IEEE
13 years 7 months ago
2005
IEEE
Hash functions are an important cryptographic primitive. They are used to obtain a fixed-size fingerprint, or hash value, of an arbitrary long message. We focus particularly on ...
EUROCRYPT
2004
Springer
13 years 10 months 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...
CHES
2011
Springer
12 years 5 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...
ISW
2009
Springer
13 years 12 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 ...