Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5

Abstract. This paper describes new techniques for fast correlation attacks, based on Gallager iterative decoding algorithm using parity-check equations of weight greater than 3. These attacks can be applied to any key-stream generator based on LFSRs and it does not require that the involved feedback polynomial have a low weight. We give a theoretical analysis of all fast correlation attacks, which shows that our algorithm with parity-check equations of weight 4 or 5 is usually much more efficient than correlation attacks based on convolutional codes or on turbo codes. Simulation results confirm the validity of this comparison. In this context, we also point out the major role played by the nonlinearity of the Boolean function used in a combination generator.

• Type: Conference
• Year: 2000
• Where: EUROCRYPT
• Authors: Anne Canteaut, Michaël Trabbia
• Keywords: Cryptology, EUROCRYPT 2000, Fast Correlation Attacks, Iterative Decoding Algorithm, Parity-check Equations