On the (im)possibility of practical and secure nonlinear filters and combiners

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3897 LNCS, Issue , 2006, Pages 159-174

  Braeken, An ^a   Lano, Joseph ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Algebraic attack; Combination and filter generator; Correlation attack; Distinguishing attack; Hardware complexity

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER HARDWARE; COMPUTER SCIENCE; CONCRETE BUILDINGS; COSTS; SECURITY OF DATA;

ALGEBRAIC ATTACK; COMBINATION AND FILTER GENERATOR; CORRELATION ATTACK; DISTINGUISHING ATTACK; HARDWARE COMPLEXITY;

NONLINEAR FILTERING;

EID: 33745597327     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11693383_11     Document Type: Conference Paper

References (35)

1. m). Journal of Cryptology, 6(1):3-13, 1993.
2. Frederik Armknecht, Joseph Lano, and Bart Preneel. Extending the resynchronization attack. In Helena Handschuh and Anwar Kasan, editors, Selected Areas in Cryptography, SAC 2004, number 3357 in Lecture Notes in Computer Science, pages 19-38. Springer-Verlag, 2004.
3. Steve Babbage. Space/time trade-off in exhaustive search attacks on stream ciphers. Eurocrypt Rump session, 1996.
4. An Braeken. On the algebraic immunity of symmetric boolean functions. Technical report, K.U. Leuven, 2005.
5. An Braeken and Joseph Lano. On the (im)possibility of practical and secure nonlinear filters and combiners (extended version). COSIC technical report, 2005. https://www.cosic.esat.kuleuven.be/publications/.
6. Anne Canteaut and Michael Trabbia. Improved fast correlation attacks using parity-check equations of weight 4 and 5. In B. Preneel, editor, Advances in Cryptology - EUROCRYPT 2000, number 1807 in Lecture Notes in Computer Science, pages 573-588. Springer-Verlag, 2000.
7. Anne Canteaut and Marion Videau. Symmetric Boolean functions. IEEE Trans. Inform. Theory, 2004. Regular paper. To appear.
8. Claude Carlet and Philippe Gaborit. On the construction of balanced Boolean functions with a good algebraic immunity. Proceedings of First Workshop on Boolean Functions: Cryptography and Applications, Mars 2005, Rouen, 2005.
9. Nicolas Courtois. Fast algebraic attacks on stream ciphers with linear feedback. In D. Boneh, editor, Advances in Cryptology - CRYPTO 2003, number 2729 in Lecture Notes in Computer Science, pages 176-194. Springer-Verlag, 2003.
10. Nicolas Courtois. Cryptanalysis of sfinks. ECRYPT Stream Cipher Project, 2005.
11. Nicolas Courtois and Willi Meier. Algebraic attacks on stream ciphers with linear feedback. In E. Biham, editor, Advances in Cryptology - EUROCRYPT 2003, number 2656 in Lecture Notes in Computer Science, pages 345-359. Springer-Verlag, 2003. extended version on eprint.
12. Joan Daemen, Rene Govaerts, and Joos Vandewalle. Resynchronization weaknesses in synchronous stream ciphers. In T. Helleseth, editor, Advances in Cryptology -EUROCRYPT 1993, number 765 in Lecture Notes in Computer Science, pages 159-167. Springer-Verlag, 1993.
13. Deepak Dalai, Kishan Gupta, and Subhamoy Maitra. Cryptographically significant Boolean functions: Construction and analysis in terms of algebraic immunity. In H. Gilbert and H. Handschuh, editors, Fast Software Encryption, FSE 2005, Lecture Notes in Computer Science. Springer-Verlag, 2005.
14. n). Applicable Algebra in Engineering, Communication, and Computation, 9:139-152, 1998.
15. n): The Niho case. Information and Computation, 151(1-2):57-72, 1999.
16. Hans Dobbertin, Thor Helleseth, Vijay Kumar, and Halvard Martinsen. Ternary m-sequences with three-valued crosscorrelation: New decimations of Welch and Niho type. IEEE Transactions on Information Theory, IT-47-.1473-1481, November 2001.
17. Hakan Englund and Thomas Johansson. A new simple technique to attack filter generators and related ciphers. In Helena Handschuh and Anwar Hasan, editors, Selected Areas in Cryptography, SAC 2004, number 3357 in LNCS, pages 39-53. Springer, 2004.
18. 5). In International Symposium on Symbolic and Algebraic Computation - ISSAC 2002, pages 75-83. ACM Press, 2002.
19. Jovan Golic. Computation of low-weight parity-check polynomials. Electronics Letters, 32(21): 1981-1982, 1996.
20. Philip Hawkes and Gregory Rose. Rewriting variables: The complexity of fast algebraic attacks on stream ciphers. In Matthew Franklin, editor, Advances in Cryptology - CRYPTO 2004, number 3152 in Lecture Notes in Computer Science, pages 390-406. Springer-Verlag, 2004.
21. Tadao Kasami. The weight enumerators for several classes of subcodes of the second order binary Reed-Muller codes. Information and Control, 18:369-394, 1971.
22. Edwin Key. An analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Transactions on Information Theory, 22:732-736, 1976.
23. James Massey and Jimmy Omura. Computational method and apparatus for finite field arithmetic. US Patent No. 4, 587,627, 1986.
24. Willi Meier, Enes Pasalic, and Claude Carlet. Algebraic attacks and decomposition of boolean functions. In C. Cachin and J. Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004, number 3027 in Lecture Notes in Computer Science, pages 474-491. Springer-Verlag, 2004.
25. Havard Molland and Thor Helleseth. An improved correlation attack against irregular clocked and filtered keystream generators. In Matthew Franklin, editor, Advances in Cryptology - CRYPTO 2004, number 3152 in Lecture Notes in Computer Science, pages 373-389. Springer-Verlag, 2004.
26. n). Discrete Applied Mathematics, 22:149-161, 1989.
27. Peng Ning and Yiqun Lisa Yin. Efficient software implementation for finite field multiplication in normal basis. In Sihan Qing, Tatsuaki Okamoto, and Jianying Zhou, editors, Third International Conference on Information and Communications Security ICICS 2001, number 2229 in Lecture Notes in Computer Science, pages 177-188. Springer-Verlag, 2001.
28. Kaisa Nyberg. Differentially uniform mappings for cryptography. In T. Helleseth, editor, Eurocrypt 1993, volume 950 of Lecture Notes in Computer Science, pages 55-64. Springer-Verlag, 1993.
29. Oystein Ore. On a special class of polynomials. Trans. Amer. Math.Soc., 35:559-584, 1933.
30. Christopher Paar. Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields. Doctoral dissertation, Institute for Experimental Mathematics, University of Essen, Germany, 1994.
31. Arash Reyhani-Masoleh and Anwar Hasan. Fast normal basis multiplication using general purpose processors. IEEE Transaction on Computers, 52(3): 1379-1390, 2003.
32. Greg Rose and Philip Hawkes. On the applicability of distinguishing attacks against stream ciphers. In Proceedings of the 3rd NESSIE Workshop, page 6, 2002.
33. Rainer Rueppel. Stream ciphers. In G. Simmons, editor, Contemporary Cryptology. The Science of Information Integrity, pages 65-134. IEEE Press, 1991.
34. Thomas Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory, IT-30(5):776-780, 1984.
35. Volker Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354-356, 1969.