Abstract
A vast amount of literature on stream ciphers is directed to the cryptanalysis of LFSR-based filters and combiners, resulting in various cryptanalytic attacks. In this paper, we present a unified framework for the security of a design against these attacks based on the properties of the LFSR(s) and the Boolean function used. It is explained why building nonlinear filters seems more practical than building nonlinear combiners. We also investigate concrete building blocks that offer a good trade-off in their resistance against these various attacks, and can at the same time be used to build a low-cost synchronous stream cipher for hardware applications.
This work was supported in part by the Concerted Research Action (GOA) Ambiorics – 2005/11 of the Flemish Government and by the European Commission through the IST Programme under Contract IST-2002-507932 ECRYPT. An Braeken is a F.W.O. Research Assistant, sponsored by the Fund for Scientific Research – Flanders (Belgium), Joseph Lano is financed by a Ph.D. grant of the Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen).
Chapter PDF
Similar content being viewed by others
Keywords
References
Agnew, G., Beth, T., Mullin, R., Vanstone, S.: Arithmetic operations in GF(2m). Journal of Cryptology 6(1), 3–13 (1993)
Armknecht, F., Lano, J., Preneel, B.: Extending the resynchronization attack. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 19–38. Springer, Heidelberg (2004)
Babbage, S.: Space/time trade-off in exhaustive search attacks on stream ciphers. Eurocrypt Rump session (1996)
Braeken, A.: On the algebraic immunity of symmetric boolean functions. Technical report, K.U. Leuven (2005)
Braeken, A., Lano, J.: 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/
Canteaut, A., Trabbia, M.: Improved fast correlation attacks using parity-check equations of weight 4 and 5. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 573–588. Springer, Heidelberg (2000)
Canteaut, A., Videau, M.: Symmetric Boolean functions. IEEE Trans. Inform. Theory (2004) (to appear); Regular paper
Carlet, C., Gaborit, P.: On the construction of balanced Boolean functions with a good algebraic immunity. In: Proceedings of First Workshop on Boolean Functions: Cryptography and Applications, Rouen (March 2005)
Courtois, N.: Fast algebraic attacks on stream ciphers with linear feedback. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 176–194. Springer, Heidelberg (2003)
Courtois, N.: Cryptanalysis of sfinks. ECRYPT Stream Cipher Project (2005)
Courtois, N., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 345–359. Springer, Heidelberg (2003)
Daemen, J., Govaerts, R., Vandewalle, J.: Resynchronization weaknesses in synchronous stream ciphers. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 159–167. Springer, Heidelberg (1994)
Dalai, D., Gupta, K., Maitra, S.: Cryptographically significant boolean functions: Construction and analysis in terms of algebraic immunity. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 98–111. Springer, Heidelberg (2005)
Dobbertin, H.: One-to-one highly nonlinear power functions on GF(2n). Applicable Algebra in Engineering. Communication, and Computation 9, 139–152 (1998)
Dobbertin, H.: Almost perfect nonlinear power functions on GF(2n): The Niho case. Information and Computation 151(1-2), 57–72 (1999)
Dobbertin, H., Helleseth, T., Kumar, V., Martinsen, H.: Ternary m-sequences with three-valued crosscorrelation: New decimations of Welch and Niho type. IEEE Transactions on Information Theory, IT-47, 1473–1481 (2001)
Englund, H., Johansson, T.: A new simple technique to attack filter generators and related ciphers. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 39–53. Springer, Heidelberg (2004)
Faugère, J.-C.: A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). In: International Symposium on Symbolic and Algebraic Computation - ISSAC 2002, pp. 75–83. ACM Press, New York (2002)
Golic, J.: Computation of low-weight parity-check polynomials. Electronics Letters 32(21), 1981–1982 (1996)
Hawkes, P., Rose, G.: Rewriting variables: The complexity of fast algebraic attacks on stream ciphers. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 390–406. Springer, Heidelberg (2004)
Kasami, T.: The weight enumerators for several classes of subcodes of the second order binary Reed-Muller codes. Information and Control 18, 369–394 (1971)
Key, E.: An analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Transactions on Information Theory 22, 732–736 (1976)
Massey, J., Omura, J.: Computational method and apparatus for finite field arithmetic. US Patent No. 4, 587, 627 (1986)
Meier, W., Pasalic, E., Carlet, C.: Algebraic attacks and decomposition of boolean functions. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 474–491. Springer, Heidelberg (2004)
Molland, H., Helleseth, T.: An improved correlation attack against irregular clocked and filtered keystream generators. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 373–389. Springer, Heidelberg (2004)
Mullin, R., Onyszchuk, I., Vanstone, S.: Optimal normal bases in GF(pn). Discrete Applied Mathematics 22, 149–161 (1989)
Ning, P., Yin, Y.L.: Efficient software implementation for finite field multiplication in normal basis. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol. 2229, pp. 177–188. Springer, Heidelberg (2001)
Nyberg, K.: Differentially uniform mappings for cryptography. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 55–64. Springer, Heidelberg (1994)
Ore, O.: On a special class of polynomials. Trans. Amer. Math. Soc. 35, 559–584 (1933)
Paar, C.: Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields. Doctoral dissertation, Institute for Experimental Mathematics, University of Essen, Germany (1994)
Reyhani-Masoleh, A., Hasan, A.: Fast normal basis multiplication using general purpose processors. IEEE Transaction on Computers 52(3), 1379–1390 (2003)
Rose, G., Hawkes, P.: On the applicability of distinguishing attacks against stream ciphers. In: Proceedings of the 3rd NESSIE Workshop, p. 6 (2002)
Rueppel, R.: Stream ciphers. In: Simmons, G. (ed.) Contemporary Cryptology. The Science of Information Integrity, pp. 65–134. IEEE Press, Los Alamitos (1991)
Siegenthaler, T.: Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory IT- 30(5), 776–780 (1984)
Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik 13, 354–356 (1969)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Braeken, A., Lano, J. (2006). On the (Im)Possibility of Practical and Secure Nonlinear Filters and Combiners. In: Preneel, B., Tavares, S. (eds) Selected Areas in Cryptography. SAC 2005. Lecture Notes in Computer Science, vol 3897. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11693383_11
Download citation
DOI: https://doi.org/10.1007/11693383_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33108-7
Online ISBN: 978-3-540-33109-4
eBook Packages: Computer ScienceComputer Science (R0)