Anderson, R.J. (1995). “Searching for the optimum correlation attack.” Fast Software Encryption 1994, Lecture Notes in Computer Science, vol. 1008, ed. B. Preneel. Springer-Verlag, Berlin, 137–143.
Google Scholar
Canteaut, A. and E. Filiol (2002). “On the Influence of the Filtering Function on the Performance of Fast Correlation Attacks on Filter Generators.” Symposium on Information theory in the Benelux, May 2002.
Google Scholar
Courtois, N.T and W. Meier (2003). “Algebraic attacks on stream ciphers with linear feedback.” Advances in Cryptology—EUROCRYPT 2003, Lecture Notes in Computer Science, vol. 2656, ed. E. Biham. Springer-Verlag, Berlin, 345–359.
Google Scholar
Golić, J.Dj. (1996). “On the security of nonlinear filter generators.” Fast Software Encryption 1996, Lecture Notes in Computer Science, vol. 1039, ed. D. Gollman. Springer-Verlag, Berlin, 173–188.
Google Scholar
Jönsson, F. and T. Johansson (2002). “A fast correlation attack on LILI-128.” Information Processing Letters, 81 (3), 127–132.
Article
MATH
MathSciNet
Google Scholar
Key, E.L. (1976). “An analysis of the structure and complexity of nonlinear binary sequence generators.” IEEE Transactions on Information Theory, 22, 732–736.
Article
MATH
Google Scholar
Lee, S., S. Chee, S. Park, and S. Park (1996). “Conditional correlation attack on nonlinear filter generators.” Advances in Cryptography—ASIACRYPT'96, Lecture Notes in Computer Science, vol. 1163, eds. K. Kim and T. Matsumoto. Springer-Verlag, Berlin, 360–367.
Google Scholar
Massey, J.L. (2001). “The ubiquity of Reed–Muller codes.” Applied Algebra, Algebraic Algorithms and Error-Correcting Codes—AAECC-14, Lecture Notes in Computer Science, vol. 2227, eds. S. Boztas and I. Shparlinski. Springer-Verlag, Berlin, 1–12.
Google Scholar
Rueppel, R.A. (1986). Analysis and Design of Stream Ciphers. Springer-Verlag, Berlin.
MATH
Google Scholar