Sciweavers

37 search results - page 4 / 8
» fse 2007
Sort
View
FSE
2007
Springer
123views Cryptology» more  FSE 2007»
14 years 18 days ago
The Grindahl Hash Functions
In this paper we propose the Grindahl hash functions, which are based on components of the Rijndael algorithm. To make collision search sufficiently difficult, this design has the...
Lars R. Knudsen, Christian Rechberger, Søre...
FSE
2007
Springer
105views Cryptology» more  FSE 2007»
14 years 18 days ago
New Bounds for PMAC, TMAC, and XCBC
We provide new security proofs for PMAC, TMAC, and XCBC message authentication modes. The previous security bounds for these modes were σ2 /2n , where n is the block size in bits ...
Kazuhiko Minematsu, Toshiyasu Matsushima
FSE
2007
Springer
192views Cryptology» more  FSE 2007»
14 years 18 days ago
Algebraic Cryptanalysis of 58-Round SHA-1
In 2004, a new attack against SHA-1 has been proposed by a team leaded by Wang [15]. The aim of this article5 is to sophisticate and improve Wang’s attack by using algebraic tech...
Makoto Sugita, Mitsuru Kawazoe, Ludovic Perret, Hi...
FSE
2007
Springer
136views Cryptology» more  FSE 2007»
14 years 18 days ago
New Lightweight DES Variants
In this paper we propose a new block cipher, DESL (DES Lightweight), which is based on the classical DES (Data Encryption Standard) design, but unlike DES it uses a single S-box re...
Gregor Leander, Christof Paar, Axel Poschmann, Kai...
FSE
2007
Springer
129views Cryptology» more  FSE 2007»
14 years 18 days ago
Cryptanalysis of FORK-256
In this paper we present a cryptanalysis of a new 256-bit hash function, FORK-256, proposed by Hong et al. at FSE 2006. This cryptanalysis is based on some unexpected differential...
Krystian Matusiewicz, Thomas Peyrin, Olivier Bille...