658 search results - page 85 / 132 » The Grindahl Hash Functions |
107
click to vote
ASIACRYPT
2007
Springer
15 years 1 months ago
2007
Springer
In an effort to design a MAC scheme that is built using block cipher components and runs faster than the modes of operation for message authentication, Daemen and Rijmen have propo...
115
click to vote
ACNS
2009
Springer
15 years 4 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...
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
We put forward a new model for understanding the security of symmetric-key primitives, such as block ciphers. The model captures the fact that many such primitives often consist of...
CHES
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. In this paper we study six 2nd round SHA-3 candidates from a side-channel cryptanalysis point of view. For each of them, we give the exact procedure and appropriate choic...
ISW
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we present free-start collisions for the TIB3 hash function with a complexity of about 232 compression function evaluations. By using message modification technique...