Vectorial Approach to Fast Correlation Attacks

Abstract.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

[1]  Antoine Joux,et al.  Fast Correlation Attacks: An Algorithmic Point of View , 2002, EUROCRYPT.

[2]  Hideki Imai,et al.  Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..

[3]  Jovan Dj. Golic,et al.  Iterative optimum symbol-by-symbol decoding and fast correlation attacks , 2001, IEEE Trans. Inf. Theory.

[4]  Willi Meier,et al.  Fast correlation attacks on certain stream ciphers , 1989, Journal of Cryptology.

[5]  Jovan Dj. Golic,et al.  A Comparison of Cryptanalytic Principles Based on Iterative Error-Correction , 1991, EUROCRYPT.

[6]  Kencheng Zeng,et al.  On the Linear Syndrome Method in Cryptanalysis , 1988, CRYPTO.

[7]  Thomas Siegenthaler,et al.  Decrypting a Class of Stream Ciphers Using Ciphertext Only , 1985, IEEE Transactions on Computers.

[8]  J. D. Golic.  Computation of low-weight parity-check polynomials , 1996 .

[9]  Vladimir V. Chepyzhov,et al.  A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers , 2000, FSE.

[10]  Thomas Johansson,et al.  Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes , 1999, EUROCRYPT.

[11]  Carlos R. P. Hartmann,et al.  An optimum symbol-by-symbol decoding rule for linear codes , 1976, IEEE Trans. Inf. Theory.

[12]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[13]  Jovan Dj. Golic,et al.  Fast Low Order Approximation of Cryptographic Functions , 1996, EUROCRYPT.

[14]  Hideki Imai,et al.  A Low-Complexity and High-Performance Algorithm for the Fast Correlation Attack , 2000, FSE.

[15]  J. Bibb Cain,et al.  Error-Correction Coding for Digital Communications , 1981 .

[16]  Hideki Imai,et al.  Fast Correlation Attack Algorithm with List Decoding and an Application , 2001, FSE.

[17]  Hideki Imai,et al.  On Decoding Techniques for Cryptanalysis of Certain Encryption Algorithms , 2001 .