A survey on fast correlation attacks

Authors:
Martin Ågren;Carl Löndahl;Martin Hell;Thomas Johansson
Affiliations:
Department of Electrical and Information Technology, Lund University, Lund, Sweden 221 00;Department of Electrical and Information Technology, Lund University, Lund, Sweden 221 00;Department of Electrical and Information Technology, Lund University, Lund, Sweden 221 00;Department of Electrical and Information Technology, Lund University, Lund, Sweden 221 00
Venue:
Cryptography and Communications
Year:
2012

Citing 27
Cited 0

Fast correlation attacks on certain stream ciphers

Journal of Cryptology
A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence

AUSCRYPT '90 Proceedings of the international conference on cryptology on Advances in cryptology
Noise-tolerant learning, the parity problem, and the statistical query model

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
A Generalized Birthday Problem

CRYPTO '02 Proceedings of the 22nd 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
Correlation Attacks on Stream Ciphers: Computing Low-Weight Parity Checks Based on Error-Correcting Codes

Proceedings of the Third International Workshop on Fast Software Encryption
A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers

FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
A Low-Complexity and High-Performance Algorithm for the Fast Correlation Attack

FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Fast Correlation Attack Algorithm with List Decoding and an Application

FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Computation of Low-Weight Parity Checks for Correlation Attacks on Stream Ciphers

Proceedings of the 5th IMA Conference on Cryptography and Coding
Noise-tolerant learning, the parity problem, and the statistical query model

Journal of the ACM (JACM)
Learning polynomials with queries: The highly noisy case

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Decrypting a Class of Stream Ciphers Using Ciphertext Only

IEEE Transactions on Computers
On a fast correlation attack on certain stream ciphers

EUROCRYPT'91 Proceedings of the 10th 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
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
Multi-pass fast correlation attack on stream ciphers

SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Fast correlation attacks: methods and countermeasures

FSE'11 Proceedings of the 18th international conference on Fast software encryption
An algorithm for solving the LPN problem and its application to security evaluation of the HB protocols for RFID authentication

INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
An improved LPN algorithm

SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Iterative optimum symbol-by-symbol decoding and fast correlation attacks

IEEE Transactions on Information Theory
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)

IEEE Transactions on Information Theory
An optimum symbol-by-symbol decoding rule for linear codes

IEEE Transactions on Information Theory
Fast evaluation of logarithms in fields of characteristic two

IEEE Transactions on Information Theory
Modeling Block Decoding Approaches for the Fast Correlation Attack

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fast correlation attacks, pioneered by Meier and Staffelbach in 1988, constitute an important class of attacks on stream ciphers. They exploit a correlation between the keystream and the output of a linear feedback shift register (LFSR) within the cipher. Several factors affect the feasibility of such an attack, e.g., the amount of available keystream and the number of taps in the LFSR. Notably, for a fixed number of taps, the length of the LFSR does not affect the complexity of the attack. When the register does not have a sufficiently small number of taps, however, the attacker will try to find parity check equations of low weight, at which point the length of the register does matter. In this paper, we go through the significant contributions to this field of cryptanalysis, reiterating the various algorithms that have been developed for finding parity check equations and performing the online stage on received keystream. We also suggest some new generalizations of Meier-Staffelbach's original formulations.