Fast correlation attacks on certain stream ciphers
Journal of Cryptology
Error-Correction Coding for Digital Communications
Error-Correction Coding for Digital Communications
On the Linear Syndrome Method in Cryptoanalysis
CRYPTO '88 Proceedings of the 8th 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
Fast Correlation Attack Algorithm with List Decoding and an Application
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Fast low order approximation of cryptographic functions
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
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
Iterative optimum symbol-by-symbol decoding and fast correlation attacks
IEEE Transactions on Information Theory
Multi-pass fast correlation attack on stream ciphers
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
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
Fast computation of large distributions and its cryptographic applications
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
| Hi-index | 0.00 |
A new, vectorial approach to fast correlation attacks on binary memoryless combiners is proposed. Instead of individual input sequences or their linear combinations, the new attack is targeting subsets of input sequences as a whole thus exploiting the full correlation between the chosen subset and the output sequence. In particular, the set of all the input sequences can be chosen as the target. The attack is based on a novel iterative probabilistic algorithm which is also applicable to general memoryless combiners over finite fields or finite rings. To illustrate the effectiveness of the introduced approach, experimental results obtained for random balanced combining functions are presented