Fast correlation attacks on stream ciphers
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Fast correlation attacks on certain stream ciphers
Journal of Cryptology
Fast Algorithms for Digital Signal Processing
Fast Algorithms for Digital Signal Processing
Fast Correlation Attacks Based on Turbo Code Techniques
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Fast Correlation Attacks through Reconstruction of Linear Polynomials
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
The First Experimental Cryptanalysis of the Data Encryption Standard
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Fast Correlation Attacks: An Algorithmic Point of View
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Ciphertext Only Reconstruction of Stream Ciphers Based on Combination Generators
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Distinguishing Attacks on SOBER-t16 and t32
FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
Cryptanalysis of Stream Ciphers with Linear Masking
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Decrypting a Class of Stream Ciphers Using Ciphertext Only
IEEE Transactions on Computers
Cryptanalysis of Achterbahn-128/80 with a New Keystream Limitation
Research in Cryptology
Multidimensional Extension of Matsui's Algorithm 2
Fast Software Encryption
Algorithmic Cryptanalysis
On Linear Cryptanalysis with Many Linear Approximations
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Improved fast correlation attacks on stream ciphers via convolutional codes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
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
Cryptanalysis of Achterbahn-Version 2
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
IEEE Transactions on Information Theory
Cryptanalysis of achterbahn-128/80
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
| Hi-index | 0.00 |
The combination generator is a popular stream cipher construction. It consists of several independent devices working in parallel whose outputs are combined by a Boolean function. The output of this function is the keystream. The security of this generator has been extensively studied in the case where the devices are LFSRs. Some particular cases where the devices are nonlinear have also been studied, most notably the different versions of the eSTREAM proposal named Achterbahn. Several cryptanalysis techniques against these ciphers have been published, extending the classical correlation attack. But each of these attacks has been presented mainly in a very particular scenario. Therefore, this paper aims at generalising these methods to any combination generator in order to be able to compare their respective advantages and to determine the optimal attack for each particular generator. Generic formulas for the data-time-space complexities are then provided, which only depend on the number of devices, their periods and the number of their internal states and of the Boolean combining function. Some of the considered improvements can also be used in a much more general context, which includes linear attacks against some block ciphers.