Abstract
Boolean functions used in a cryptographic system should have high algebraic immunity to resist algebraic attacks. This paper presents a matrix method for constructing balanced Boolean functions achieving maximum algebraic immunity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. W. Golomb and G. Gong, Signal design for good correlation for wireless communication, cryptography and radar, Cambridge University Press, New York, 2005.
C. Carlet and C. Ding, Highly nonlinear mappings, Journal of Complexity, 2004, 20(2–3): 205–244.
D. Pei, The correlation of a Boolean function with its variables, Lecture Notes in Computer Science, 2000, 1977: 101–111.
T. Siegenthder, Correlation immunity of non-linear combining functions for cryptographic applications, IEEE Transaction on Information Theory, 1984, 30: 776–780.
M. Matsui, Linear cryptanalysis method for DES cipher, Lecture Notes in Computer Science, 1994, 765: 386–397.
N. Courtois and W. Meier, Algebraic attacks on stream ciphers with linear feedback, Eurocrypt 2003, Lecture Notes in Computer Science, 2003, 2656: 345–359.
N. Courtois, Fast algebraic attacks on stream ciphers with linear feedback, Crypto 2003, Lecture Notes in Computer Science, 2003, 2729: 176–194.
W. Meier, E. Pasalic and C. Carlet, Algebraic attacks and decomposition of Boolean functions, Eurocrypt 2004, Lecture Notes in Computer Science, 2004, 3027: 474–491.
C. Carlet, D. K. Dalai, K. C. Gupta, et al., Algebraic immunity for cryptographically significant Boolean functions: Analysis and construction, IEEE Transaction on Information Theory, 2006, 52(7): 3105–3121.
Y. Chen and P. Lu, A first order recursive construction of Boolean function with optimum algebraic immunity, Cryptology ePrint Archive, 2009, Report 2009/134.
C. Carlet and K. Feng, An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity, Asiacrypt 2006, Lecture Notes in Computer Science, 2008, 5350: 425–440.
Q. Wang, J. Peng, H. Kan, and X. Xue, Constructions of cryptographically significant Boolean functions using primitive polynomials, IEEE Transaction on Information Theory, 2010, 56(6): 3048–3053.
X. Tang, D. Tang, X. Zeng, and L. Hu, Balanced Boolean functions with (almost) optimal algebraic immunity and very high nonlinearity, Cryptology ePrint Archive, 2010, Report 2010/443.
D. K. Dalai, S. Maitra, and S. Sarkar, Baisc theory in construction of Boolean functions with maximum possible annihilator immunity, Designs, Codes, Cryptogr, 2006, 40(1): 41–58.
N. Li and W. F. Qi, Construction and analysis of Boolean functions of 2t + 1 variables with maximum algebraic immunity, Asiacrypt 2006, Lecture Notes in Computer Science, 2006, 4284: 84–98.
A. Canteaut, Open problems related to algebraic attacks on stream ciphers, Workshop on Coding and Cryptography — WCC 2005, Lecture Notes in Computer Science, 2006, 3969: 120–134.
C. Ding, G. Xiao, and W. Shan, The Stability Theory of Stream Ciphers, Springer-Verlag, 1991.
M. Lobanov, Tight bound between nonlinearity and algebraic immunity, Cryptology ePrint Archive, 2005, Report 2005/441.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is supported by the National Natural Science Foundation of China under Grant Nos. 61070172 and 10990011, the Strategic Priority Research Program of Chinese Academy of Sciences under Grant No. XDA06010702, and the State Key Laboratory of Information Security, Chinese Academy of Sciences.
This paper was recommended for publication by Editor Ziming LI.
Rights and permissions
About this article
Cite this article
Xie, Y., Hu, L. A matrix construction of Boolean functions with maximum algebraic immunity. J Syst Sci Complex 25, 792–801 (2012). https://doi.org/10.1007/s11424-012-0286-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-012-0286-z