1769 search results - page 171 / 354 » Cryptography |
116
Voted
FSE
2007
Springer
15 years 9 months ago
2007
Springer
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...
112
click to vote
FSE
2007
Springer
15 years 9 months ago
2007
Springer
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...
107
Voted
FSE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In Wang’s attack, message modifications allow to deterministically satisfy certain sufficient conditions to find collisions efficiently. Unfortunately, message modi...
FSE
2007
Springer
15 years 9 months ago
2007
Springer
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 ...
113
Voted
FSE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Given (deterministic) ciphers E and E that can encipher messages of l and n bits, respectively, we construct a cipher E∗ = XLS[E, E] that can encipher messages of l + s...