Recent Results on Constructing Boolean Functions with (Potentially) Optimal Algebraic Immunity Based on Decompositions of Finite Fields
Boolean functions with optimal algebraic immunity (OAI functions) are important cryptographic primitives in the design of stream ciphers. During the past decade, a lot of work has been done on constructing such functions, among which mathematics, especially finite fields, play an important role. Notably, the approach based on decompositions of additive or multiplicative groups of finite fields turns out to be a very successful one in constructing OAI functions, where some original ideas are contributed by Tu and Deng (2012), Tang, et al. (2017), and Lou, et al. (2015). Motivated by their pioneering work, the authors and their collaborators have done a series of work, obtaining some more general constructions of OAI functions based on decompositions of finite fields. In this survey article, the authors review our work in this field in the past few years, illustrating the ideas for the step-by-step generalizations of previous constructions and recalling several new observations on a combinatorial conjecture on binary strings known as the Tu-Deng conjecture. In fact, the authors have obtained some variants or more general forms of Tu-Deng conjecture, and the optimal algebraic immunity of certain classes of functions we constructed is based on these conjectures.
KeywordsAdditive decomposition algebraic immunity Boolean function multiplicative decomposition Tu-Deng conjecture
Unable to display preview. Download preview PDF.
The year of 2019 will be the centenary of Professor Wen-tsün Wu’s birth. He is one outstanding Chinese mathematician and passed away on May 7th, 2017. We are writing this paper to commemorate him. As some of Wu’s disciples, we learned a lot from him in the past days, especially got many benefits from the mathematics mechanization initiated by him. Into his 90’s, Prof. Wu showed great interests in cryptography and had worked very hard on such important cryptographic problems as factorization of big integers. Inspired by his spirits, we also carried out some researches in the field of cryptography in recent years, and a part of our results form this paper. We will forever be grateful for the knowledge and spiritual heritage that Prof. Wu had passed on to us.
- Meier M, Pasalic E, and Carlet C, Algebraic attacks and decomposition of boolean functions, Proc. Adv. Cryptol. — EUROCRYPT’04 (Eds. by Cachin C and Camenisch J), Switzerland, 2004.Google Scholar
- Courtois N and Meier M, Algebraic attack on stream ciphers with linear feedback, Proc. Adv. Cryptol. — EUROCRYPT’03 (Ed. by Biham E), Warsaw, 2003.Google Scholar
- Li N and Qi W, Construction and analysis of boolean functions of 2t + 1 variables with maximum algebraic immunity, Proc. Adv. Cryptol. — ASIACRYPT’06 (Eds. by Lai X and Chen K), Shanghai, 2006.Google Scholar
- Courtois N, Fast algebraic attacks on stream ciphers with linear feedback, Proc. Adv. Cryptol. — CRYPTO’03 (Ed. by Boneh D), California, 2003.Google Scholar
- Carlet C and Feng K, An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity, Proc. Adv. Cryptol. — ASIACRYPT’08 (Ed. by Pieprzyk J), Melbourne, 2008.Google Scholar
- Liu M, Zhang Y, and Lin D, Perfect algebraic immune functions, Proc. Adv. Cryptol. — ASIACRYPT’ 12 (Eds. Wang X and Sako K), Beijing, 2012.Google Scholar
- Cohen G and Flori J P, On a generalized combinatorial conjecture involving addition mod 2k-1, Cryptology ePrint Archive, Report 2011/400, 2011, http://eprint.iacr.org/.Google Scholar
- Wang T, Liu M, and Lin D, Construction of resilient and nonlinear boolean functions with almost perfect immunity to algebraic and fast algebraic attacks, Inscrypt 2012 (Eds. by Kutylowski M and Yung M), Beijing, 2012.Google Scholar
- Wu B, Jin Q, and Liu Z, Constructing Boolean functions with potential optimal algebraic immunity based on additive decompositions of finite fields (extended abstract), Proceeding of 2014 IEEE International Symposium on Information Theory (Eds. by Høst-Madsen A, Kavcic A, and Veeravalli V), Honolulu, 2014.Google Scholar
- Wang Q and Tan C, Properties of a Family of Cryptographic Boolean Functions, SETA 2014 (Eds. by Schmidt K U and Winterhof A), Melbourne, 2014.Google Scholar
- Wu B, Zheng J, and Lin D, Constructing Boolean functions with (potentially) optimal alge braic immunity based on multiplicative decompositions of finite fields, Proceeding of 2015 IEEE International Symposium on Information Theory (Eds. by Tse D and Yeung R), Hong Kong, 2015.Google Scholar
- Carlet C, Boolean functions for cryptography and error correcting codes, Monography Boolean Methods and Models (Eds. by Crama Y and Hammer P), Cambridge University Press, London, 2010.Google Scholar
- Carlet C, On a weakness of the Tu-Deng function and its repair, Cryptology ePrint Archive, report 2009/606, 2009, http://eprint.iacr.org/.Google Scholar
- Flori J P, Randriam H, Cohen G, et al., On a Conjecture about Binary Strings Distribution, Sequences and Their Applications — SETA 2010 (Eds. by Carlet C and Pott A), Paris, 2010.Google Scholar
- Qarboua S, Schrek J, and Fontaine C, New results about Tu-Deng’s conjecture, 2016 IEEE International Symposium on Information Theory (ISIT) (Eds. by Fàbregas A, Martinez A, and Verdú S), Barcelona, 2016.Google Scholar
- Spiegelhofer L and Wallner M, The Tu-Deng conjecture holds almost surely, arXiv: 1707.07945v2 [math.CO], 2017, https://arxiv.org/pdf/1707.07945.pdf.Google Scholar