A. Canteaut and M. Trabbia, Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5, Advances in Cryptology -EUROCRYPT'2000, pp.573-588, 2000.
DOI : 10.1007/3-540-45539-6_40

P. Chose, A. Joux, and M. Mitton, Fast Correlation Attacks: An Algorithmic Point of View, Advances in Cryptology - EUROCRYPT 2002, pp.209-221, 2002.
DOI : 10.1007/3-540-46035-7_14

D. Coppersmith, ), Proceedings of the sixteenth annual ACM symposium on Theory of computing , STOC '84, pp.201-207, 1984.
DOI : 10.1145/800057.808682

D. Coppersmith, Fast evaluation of logarithms in fields of characteristic two, IEEE Transactions on Information Theory, vol.30, issue.4, pp.587-593, 1984.
DOI : 10.1109/TIT.1984.1056941

M. Finiasz and S. Vaudenay, When Stream Cipher Analysis Meets Public-Key Cryptography, Lecture Notes in Computer Science, 2006.
DOI : 10.1007/978-3-540-74462-7_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.1228

K. Huber, Some comments on Zech's logarithms, IEEE Transactions on Information Theory, vol.36, issue.4, p.946, 1990.
DOI : 10.1109/18.53764

T. Johansson and F. Jönsson, Fast Correlation Attacks Based on Turbo Code Techniques, Advances in Cryptology - CRYPTO'99, pp.181-197, 1999.
DOI : 10.1007/3-540-48405-1_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.688

T. Johansson and F. Jönsson, Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes, Advances in Cryptology -EUROCRYPT'99, pp.347-362, 1999.
DOI : 10.1007/3-540-48910-X_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.9644

T. Johansson and F. Jönsson, Fast Correlation Attacks through Reconstruction of Linear Polynomials, Advances in Cryptology -CRYPTO'00, pp.300-315, 2000.
DOI : 10.1007/3-540-44598-6_19

W. Meier and O. Staffelbach, Fast Correlation Attacks on Stream Ciphers, Advances in Cryptology -EUROCRYPT'88, pp.301-314, 1988.
DOI : 10.1007/3-540-45961-8_28

W. T. Penzhorn and G. J. Kühn, Computation of low-weight parity checks for correlation attacks on stream ciphers, Cryptography and Coding -5th IMA Conference, pp.74-83, 1995.
DOI : 10.1007/3-540-60693-9_10

S. C. Pohlig and M. E. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Transactions on Information Theory, pp.24106-110, 1978.
DOI : 10.1109/tit.1978.1055817

T. Siegenthaler, Cryptanalysts Representation of Nonlinearly Filtered ML-Sequences, EUROCRYPT, pp.103-110, 1985.
DOI : 10.1007/3-540-39805-8_12

D. Wagner, A Generalized Birthday Problem, Advances in cryptology?CRYPTO 2002, pp.288-303, 2002.
DOI : 10.1007/3-540-45708-9_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.3854