Fast Algorithms for Digital Signal Processing
Fast Algorithms for Digital Signal Processing
Improved fast correlation attacks using parity-check equations of weight 4 and 5
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
IEEE Transactions on Information Theory
Cryptanalysis of Achterbahn-128/80 with a New Keystream Limitation
Research in Cryptology
Computing the biases of parity-check relations
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Correlation attacks on combination generators
Cryptography and Communications
| Hi-index | 0.00 |
This paper presents two key-recovery attacks against Achterbahn- 128/80, the last version of one of the stream cipher proposals in the eSTREAM project. The attack against the 80-bit variant, Achterbahn- 80, has complexity 261. The attack against Achterbahn-128 requires 280.58 operations and 260 keystream bits. These attacks are based on an improvement of the attack due to Hell and Johansson against Achterbahn version 2. They mainly rely on an algorithm that makes profit of the independence of the constituent registers.