Abstract
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSR-based stream ciphers. An algorithm is described which permits to compute the algebraic immunity d of a Boolean function with n variables in \(\mathcal{O}(D^2)\) operations, for \(D \approx \binom{n}{d}\), rather than in \(\mathcal{O}(D^3)\) operations necessary in all previous algorithms. Our algorithm is based on multivariate polynomial interpolation. For assessing the vulnerability of arbitrary Boolean functions with respect to fast algebraic attacks, an efficient generic algorithm is presented that is not based on interpolation. This algorithm is demonstrated to be particularly efficient for symmetric Boolean functions. As an application it is shown that large classes of symmetric functions are very vulnerable to fast algebraic attacks despite their proven resistance against conventional algebraic attacks.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-540-34547-3_36
Chapter PDF
Similar content being viewed by others
Keywords
References
Armknecht, F., Ars, G.: Introducing a New Variant of Fast Algebraic Attacks and Minimizing Their Successive Data Complexity. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol. 3715, pp. 16–32. Springer, Heidelberg (2005)
Armknecht, F.: Algebraic Attacks and Annihilators. In: WEWoRC 2005. LNI, vol. P-74, pp. 13–21. Gesellschaft für Informatik (2005)
Armknecht, F.: Improving Fast Algebraic Attacks. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 65–82. Springer, Heidelberg (2004)
Ars, G.: Application des Bases de Gröbner à la Cryptographie. Thèse de l’Université de Rennes (2005)
Braeken, A., Lano, J.: On the (Im)Possibility of Practical and Secure Nonlinear Filters and Combiners. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 159–174. Springer, Heidelberg (2006)
Braeken, A., Lano, J., Mentens, N., Preneel, B., Verbauwhede, I.: SFINKS: A Synchronous Stream Cipher for Restricted Hardware Environments. In: eSTREAM, ECRYPT Stream Cipher Project, Report, 2005/026 (2005), available at: http://www.ecrypt.eu.org/stream
Braeken, A., Preneel, B.: On the Algebraic Immunity of Symmetric Boolean Functions. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol. 3797, pp. 35–48. Springer, Heidelberg (2005)
Camion, P., Carlet, C., Charpin, P., Sendrier, N.: On Correlation-Immune Functions. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 86–100. Springer, Heidelberg (1992)
Canteaut, A., Videau, M.: Symmetric Boolean Functions. IEEE Transactions on Information Theory 51(8), 2791–2811 (2005)
Carlet, C., Gaborit, P.: On the Construction of Boolean Functions with a Good Algebraic Immunity. In: Boolean Functions: Cryptography and Applications - BFCA (2005)
Courtois, N.: Cryptanalysis of SFINKS. In: Information Security and Cryptology - ICISC (to appear, 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)
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., Pieprzyk, J.: Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 267–287. Springer, Heidelberg (2002)
Dalai, D.K., Gupta, K.C., 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)
Dalai, D.K., Gupta, K.C., Maitra, S.: Notion of Algebraic Immunity and its Evaluation related to Fast Algebraic Attacks. In: Second International Workshop on Boolean Function Cryptography and Applications (2006)
Dalai, D.K., Maitra, S., Sarkar, S.: Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity. In: Design, Codes and Cryptography. Springer, Heidelberg (to appear, 2006)
Fine, N.J.: Binomial Coefficients Modulo a Prime. The American Mathematical Monthly 54, 589–592 (1947)
Faugère, J.-C., Ars, G.: An Algebraic Cryptanalysis of Nonlinear Filter Generators using Gröbner bases. In: Rapport de Recherche INRIA, vol. 4739 (2003)
Hawkes, P., Rose, G.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)
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)
Meier, W., Staffelbach, O.: Nonlinearity Criteria for Cryptographic Functions. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 549–562. Springer, Heidelberg (1990)
Mourrain, B., Ruatta, O.: Relations Between Roots and Coefficients, Interpolation and Application to System Solving. J. Symb. Comput. 33(5), 679–699 (2002)
Nawaz, Y., Gong, G., Gupta, K.: Upper Bounds on Algebraic Immunity of Power Functions. In: Robshaw, M.J.B. (ed.) FSE 2006. LNCS, vol. 4047, pp. 375–389. Springer, Heidelberg (2006)
Olver, P.J.: On Multivariate Interpolation. Stud. Appl. Math. 116, 201–240 (2006)
Siegenthaler, T.: Correlation-Immunity of Nonlinear Combining Functions for Cryptographic Applications. IEEE Transactions on Information Theory 30(5), 776–780 (1984)
Siegenthaler, T.: Decrypting a Class of Stream Ciphers Using Ciphertext Only. IEEE Transactions on Computer 34(1), 81–85 (1985)
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
Armknecht, F., Carlet, C., Gaborit, P., Künzli, S., Meier, W., Ruatta, O. (2006). Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks. In: Vaudenay, S. (eds) Advances in Cryptology - EUROCRYPT 2006. EUROCRYPT 2006. Lecture Notes in Computer Science, vol 4004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11761679_10
Download citation
DOI: https://doi.org/10.1007/11761679_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34546-6
Online ISBN: 978-3-540-34547-3
eBook Packages: Computer ScienceComputer Science (R0)