Abstract
We sharpen some lower bounds on the higher order nonlinearity of a Boolean function in terms of the value of its algebraic immunity and obtain new tight bounds. We prove a universal tight lower bound, which enables us to reduce the problem of estimating higher order nonlinearity to finding the dimension of certain linear subspaces in the space of Boolean functions. As a simple corollary of this result, we obtain all previously known estimates in this area. For polynomials with disjoint terms, finding the dimension of those linear subspaces reduces to a simple combinatorial inspection. We prove a tight lower bound on the second order nonlinearity of a Boolean function in terms of the value of its algebraic immunity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. S. Lobanov, “Exact Relation Between Nonlinearity and Algebraic Immunity,” Diskret. Mat. 18(3), 152–159 (2006) [Discrete Math. Appl. 16 (5), 453–460 (2006)].
M. S. Lobanov, “An Estimate of High Order Nonlinearity of a Boolean Function Using the Value of Its Algebraic Immunity,” in Proceedings of VI Scientific School of Young Researches on Discrete Mathematics and Its Applications (Moscow, April 2007), Vol. 2 (Institute of Applied Mathematics, Moscow, 2007), pp. 11–16.
A. Canteaut, “Open Problems Related to Algebraic Attacks on Stream Ciphers,” in Lecture Notes in Computer Science, Vol. 3969: International Workshop on Coding and Cryptography (WCC 2005), Bergen, March 2005 (Berlin, Springer, 2006), pp. 1–11.
C. Carlet, “On the Higher Order Nonlinearities of Algebraic Immune Functions,” in Lecture Notes in Computer Science, Vol. 4117: CRYPTO 2006 (Berlin, Springer, 2006), pp. 584–601.
N. Courtois and W. Meier, “Algebraic Attacks on Stream Ciphers with Linear Feedback,” in Lecture Notes in Computer Science, Vol. 2656: Advances in Cryptology, EUROCRYPT 2003 (Berlin, Springer, 2003), pp. 345–359.
D. K. Dalai, K. C. Gupta, and S. Maitra, “Results on Algebraic Immunity for Cryptographically Significant Boolean Functions,” in Lecture Notes in Computer Science, Vol. 3348: Indocrypt 2004 (Chennai, India, December 20–22, 2004) (Berlin, Springer, 2004), pp. 92–106.
W. Meier, E. Pasalic, and C. Carlet, “Algebraic Attacks and Decomposition of Boolean Functions,” in Lecture Notes in Computer Science, Vol. 3027: Advances in Cryptology, EUROCRYPT 2004 (Berlin, Springer, 2004), pp. 474–491.
S. Mesnager, “Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions with Prescribed Algebraic Immunity,” Cryptology ePrint archive http://eprint.iacr.org/, Report 2007/117.
F. J. McWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes (North-Holland, New York, 1977).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © M.S. Lobanov, 2008, published in Diskretnyi Analiz i Issledovanie Operatsii, 2008, Vol. 15, No. 6, pp. 34–47.
Rights and permissions
About this article
Cite this article
Lobanov, M.S. Exact relations between nonlinearity and algebraic immunity. J. Appl. Ind. Math. 3, 367–376 (2009). https://doi.org/10.1134/S1990478909030077
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478909030077