Fast correlation attacks on certain stream ciphers
Journal of Cryptology
Handbook of Applied Cryptography
Handbook of Applied Cryptography
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
Fast Correlation Attack Algorithm with List Decoding and an Application
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Decrypting a Class of Stream Ciphers Using Ciphertext Only
IEEE Transactions on Computers
Higher order correlation attacks, XL algorithm and cryptanalysis of Toyocrypt
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
The decimated sample based improved algebraic attacks on the nonlinear filters
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
On boolean functions with generalized cryptographic properties
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
A method for convergence analysis of iterative probabilistic decoding
IEEE Transactions on Information Theory
Theoretical analysis of a correlation attack based on convolutional codes
IEEE Transactions on Information Theory
Attacking the filter generator by finding zero inputs of the filtering function
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
On extended algebraic immunity
Designs, Codes and Cryptography
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Hi-index | 0.00 |
This paper proposes a novel approach for cryptanalysis of certain cryptographic pseudorandom sequence (keystream) generators consisting of the composition of a linear finite state machine (LFSM) and nonlinear mapping. The proposed approach includes a dedicated decimation of the sample for cryptanalysis based on the following: Suppose certain B bits of the LFSM initial state as known and identify time instances where certain arguments of the nonlinear function depend only on these B bits and are equal to zero. As opposed to previously reported methods, the proposed one also identifies and uses certain characteristics of the LFSM state-transition matrix in order to reduce the nonlinearity of the system of overdefined equations employed in an algebraic attack scenario, or to reduce the noise introduced by the linearization of the nonlinear function which corrupts the linear equations employed in a correlation attack scenario.