Sciweavers

378 search results - page 54 / 76
» A Traceable Block Cipher
Sort
View
ISW
2009
Springer
14 years 2 months ago
Nonce Generators and the Nonce Reset Problem
A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream c...
Erik Zenner
SACRYPT
2009
Springer
141views Cryptology» more  SACRYPT 2009»
14 years 2 months ago
Cryptanalysis of Dynamic SHA(2)
In this paper, we analyze the hash functions Dynamic SHA and Dynamic SHA2, which have been selected as first round candidates in the NIST hash function competition. These hash fun...
Jean-Philippe Aumasson, Orr Dunkelman, Sebastiaan ...
CRYPTO
2004
Springer
86views Cryptology» more  CRYPTO 2004»
14 years 27 days ago
On Multiple Linear Approximations
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
Alex Biryukov, Christophe De Cannière, Mich...
ASIACRYPT
1999
Springer
13 years 11 months ago
Equivalent Keys of HPC
This paper presents a weakness in the key schedule of the AES candidate HPC (Hasty Pudding Cipher). It is shown that for the HPC version with a 128-bit key, 1 in 256 keys is weak i...
Carl D'Halluin, Gert Bijnens, Bart Preneel, Vincen...
IACR
2011
209views more  IACR 2011»
12 years 7 months ago
Improved Attacks on Full GOST
GOST is a well known block cipher which was developed in the Soviet Union during the 1970’s as an alternative to the US-developed DES. In spite of considerable cryptanalytic eff...
Itai Dinur, Orr Dunkelman, Adi Shamir