Abstract
Because of the algebraic attacks, a high algebraic immunity is now an important criteria for Boolean functions used in stream ciphers. In this paper, we study the construction of Boolean functions with maximum algebraic immunity. We first present a new method to construct Boolean functions, in any number of variables, with maximum algebraic immunity(AI), and we also improve our algorithm to construct balanced functions with optimum algebraic immunity for any even number of variables. Furthermore, the enumeration and algebraic degree of the constructed Boolean functions are investigated.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
Mihaljevic, W., Imai, H.: Cryptanalysis of toyocrypt-hs1 stream cipher. IEICE Transactions on Fundamentals E85-A, 66–73 (2002)
Courtois, N.: Cryptanalysis of sfinks. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol. 3935, pp. 261–269. Springer, Heidelberg (2006)
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)
Carlet, C.: A method of construction of balanced functions with optimum algebraic immunity, http://eprint.iacr.org/2006/149
Carlet, C., Dalai, D.K., Gupta, K.C., Maitra, S.: Algebraic immunity for cryptographically significant boolean functions: Analysis and construction. IEEE Transactions on Information Theory 52(7) (2006)
Carlet, C., Feng, K.: An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 425–440. Springer, Heidelberg (2008)
Dalai, D.K., Maitra, S., Sarkar, S.: Basic theory in construction of boolean functions with maximum possible annihilator immunity. Des. Codes, Cryptography 40(1) (2006)
Li, N., Qi, W.-F.: Construction and analysis of boolean functions of 2t+1 variables with maximum algebraic immunity. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 84–98. Springer, Heidelberg (2006)
Qu, L.J., Li, C., Feng, K.Q.: A note on symmetric boolean functions with maximum algebraic immunity in odd number of variables. IEEE Transactions on Information Theory 53(8) (2007)
Qu, L.J., Li, C.: On the 2m-variable symmetric boolean functions with maximum algebraic immunity. Science in China Series F-Information Sciences 51(2) (2008)
Qu, L., Li, C.: Weight support technique and the symmetric boolean functions with maximum algebraic immunity on even number of variables. In: Pei, D., Yung, M., Lin, D., Wu, C. (eds.) Inscrypt 2007. LNCS, vol. 4990, pp. 271–282. Springer, Heidelberg (2008)
Canteaut, A.: Open problems related to algebraic attacks on stream ciphers. In: Ytrehus, Ø. (ed.) WCC 2005. LNCS, vol. 3969, pp. 120–134. Springer, Heidelberg (2006); 1–10 invited talk
Liu, M.C., Pei, D.Y.: Construction of boolean functions with maximum algebraic immunity. In: Chinacrypt 2008, pp. 79–92 (2008)
Qu, L.J., Feng, G.Z., Li, C.: On the boolean functions with maximum possible algebraic immunity: Construction and a lower bound of the count, http://eprint.iacr.org/2005/449
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dong, D., Fu, S., Qu, L., Li, C. (2009). A New Construction of Boolean Functions with Maximum Algebraic Immunity. In: Samarati, P., Yung, M., Martinelli, F., Ardagna, C.A. (eds) Information Security. ISC 2009. Lecture Notes in Computer Science, vol 5735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04474-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-04474-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04473-1
Online ISBN: 978-3-642-04474-8
eBook Packages: Computer ScienceComputer Science (R0)