Abstract
In this paper, two constructions of Boolean functions with optimal algebraic immunity are proposed. They generalize previous ones respectively given by Rizomiliotis (IEEE Trans Inf Theory 56:4014–4024, 2010) and Zeng et al. (IEEE Trans Inf Theory 57:6310–6320, 2011) and some new functions with desired properties are obtained. The functions constructed in this paper can be balanced and have optimal algebraic degree. Further, a new lower bound on the nonlinearity of the proposed functions is established, and as a special case, it gives a new lower bound on the nonlinearity of the Carlet-Feng functions, which is slightly better than the best previously known ones. For \(n\le 19\), the numerical results reveal that among the constructed functions in this paper, there always exist some functions with nonlinearity higher than or equal to that of the Carlet-Feng functions. These functions are also checked to have good behavior against fast algebraic attacks at least for small numbers of input variables.
Similar content being viewed by others
References
Armknecht F.: Improving fast algebraic attacks. In: Fast Software Encryption 2004. Lecture Notes in Computer Science, vol. 3017, pp. 65–82. Springer, Berlin (2004).
Armknecht F., Carlet C., Gaborit P., Künzli S., Meier W., Ruatta O.: Efficient computation of algebraic immunity for algebraic and fast algebraic attacks. In: Advances in Cryptology-EUROCRYPT 2006. Lecture Notes in Computer Science, vol. 4004, pp. 147–164. Springer, Berlin (2006).
Braeken A., Preneel B.: On the algebraic immunity of symmetric Boolean functions. In: Progress in Cryptology-INDOCRYPT 2004. Lecture Notes in Computer Science, vol. 3797, pp. 35–48. Springer, Berlin (2005)
Canteaut A.: Open problems related to algebraic attacks on stream ciphers. In: Proceedings of WCC 2005. Lecture Notes in Computer Science, vol. 3969, pp. 120–134. Springer, Berlin (2006)
Carlet, C.: A method of construction of balanced functions with optimum algebraic immunity. In: Proceedings of International Workshop on Coding and Cryptology, Wuyishan, China, pp. 25–43 (2008).
Carlet C.: On a weakness of the Tu–Deng function and its repair, CryptologyePrintArchive. http://eprint.iacr.org/2009/606. Accessed 2009.
Carlet C.: Boolean functions for cryptography and error correcting codes, chapter of the monography. In: Hammer P., Crama Y. (eds.) Boolean Models and Methods in Mathematics, Computer Science and Engineering, pp. 257–397. Cambridge University Press, Cambridge (2010).
Carlet C.: Comment on constructions of cryptographically significant Boolean functions using primitive polynomials. IEEE Trans. Inf. Theory 57, 4852–4853 (2011).
Carlet C., Feng K.: An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity. In: Advances in Cryptology-ASIACRYPT 2008. Lecture Notes in Computer Science, vol. 5350, pp. 425–440. Springer, Berlin (2008).
Carlet C., Dalai D.K., Gupta K.C., Maitra S.: Algebraic immunity for cryptographically significant Boolean functions: analysis and construction. IEEE Trans. Inf. Theory 52, 3105–3121 (2006).
Carlet C., Zeng X., Li C., Hu L.: Further properties of several classes of Boolean functions with optimum algebraic immunity. Des. Codes Cryptogr. 52, 303–338 (2009).
Courtois N.: Fast algebraic attacks on stream ciphers with linear feedback. In: Advances in Cryptology-CRYPTO 2003. Lecture Notes in Computer Science, vol. 2729, pp. 176–194. Springer, Berlin (2003).
Courtois N., Meier W.: Algebraic attacks on stream ciphers with linear feedback. In: Advances in Cryptology-EUROCRYPT 2003. Lecture Notes in Computer Science, vol. 2656, pp. 345–359. Springer, Berlin (2003).
Dalai D.K., Gupta K.C., Maitra S.: Cryptographically significant Boolean functions: construction and analysis in terms of algebraic immunity. In: Fast Software Encryption. Lecture Notes in Computer Science, vol. 3557, pp. 98–111. Springer, Berlin (2005).
Dalai D.K., Maitra S., Sarkar S.: Basic theory in construction of Boolean functions with maximum possible annihilator immunity. Des. Codes Cryptogr. 40, 41–58 (2006).
Ding C., Xiao G., Shan W.: The stability theory of stream ciphers. In: Lecture Notes in Computer Science, vol. 561 (1991).
Hawkes P., Rose G.: Rewriting variables: the complexity of fast algebraic attacks on stream ciphers. In: Advances in Cryptology-CRYPTO 2004. Lecture Notes in Computer Science, vol. 3152, pp. 390–406. Springer, Berlin (2004).
Li N., Qi W.: Construction and analysis of Boolean functions of \(2t+1\) variables with maximum algebraic immunity. In: Advances in Cryptology-ASIACRYPT 2006. Lecture Notes in Computer Science, vol. 4284, pp. 84–98. Springer, Berlin (2006).
Li N., Qu L., Qi W., Feng G., Li C., Xie D.: On the construction of Boolean functions with optimal algebraic immunity. IEEE Trans. Inf. Theory 54, 1330–1334 (2008).
Lidl R., Niederreiter H.: Finite fields. In: Encyclopedia of Mathematics and Its Applications, vol. 20. Addison-Wesley, Reading (1983).
Liu M., Zhang Y., Lin D.: Perfect algebraic immune functions. In: Advances in Cryptology-ASIACRYPT 2012. Lecture Notes in Computer Sinence, vol. 7658, pp. 172–189. Springer, Berlin (2012).
Meier W., Staffelbach O.: Fast correlation attacks on stream ciphers. In: Advances in Cryptology-EUROCRYPT 1988. Lecture Notes in Computer Science, vol. 330, pp. 301–314. Springer, Berlin (1988).
Meier W., Pasalic E., Carlet C.: Algebraic attacks and decomposition of Boolean functions. In: Advances in Cryptology-EUROCRYPT 2004. Lecture Notes in Computer Science, vol. 3027, pp. 474–491. Springer, Berlin (2004).
Qu L., Feng K., Liu F., Wang L.: Constructing symmetric boolean functions with maximum algebraic immunity. IEEE Trans. Inf. Theory 55, 2406–2412 (2009).
Rizomiliotis P.: On the resistance of Boolean functions against algebraic attacks using univariate polynomial representation. IEEE Trans. Inf. Theory 56, 4014–4024 (2010).
Rizomiliotis P.: On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks. Des. Codes Cryptogr. 57, 283–292 (2010).
Rønjom S., Helleseth T.: A new attack on the filter generator. IEEE Trans. Inf. Theory 53, 1752–1758 (2007).
Tang X., Tang D., Zeng X., Hu L.: Balanced Boolean functions with (almost) optimal algebraic immunity and very high nonlinearity, CryptologyePrintArchive. http://eprint.iacr.org/2010/443. Accessed 2010.
Tang D., Carlet C., Tang X.: Highly nonlinear Boolean functions with optimal algebraic immunity and good behavior against fast algebraic attacks. IEEE Trans. Inf. Theory 59, 653–664 (2013).
Tu Z., Deng Y.: A conjecture on binary string and its applications on constructing Boolean functions of optimal algebraic immunity. Des. Codes Cryptogr. 60, 1–14 (2011).
Wang Q., Johansson T.: A note on fast algebraic attacks and higher order nonlinearities. In: Proceedings of INSCRYPT. Lecture Notes in Computer Science, vol. 6584, pp. 84–98. Springer, Berlin (2010).
Wang Q., Peng J., Kan H., Xue X.: Constructions of cryptographically significant Boolean functions using primitive polynomials. IEEE Trans. Inf. Theory 56, 3048–3053 (2010).
Zeng X., Carlet C., Shan J., Hu L.: More balanced Boolean functions with optimal algebraic immunity and good nonlinearity and resistance to fast algebraic attack. IEEE Trans. Inf. Theory 57, 6310–6320 (2011).
Acknowledgments
The authors would like to thank the anonymous referees for their helpful comments, which have improved the presentation of the paper. The work of X. Zeng was supported in part by the National Science Foundation of China (NSFC) under Grant 61170257. The work of L. Hu and J. Shan was supported in part by the National Key Basic Research Program of China (2013CB834203), the NSFC under Grants 10990011, 61070172, and the Strategic Priority Research Program of Chinese Academy of Sciences under Grant XDA06010702.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by P. Charpin.
Appendix
Appendix
1.1 The proofs of Lemmas 5–8
Proof of Lemma 5
When \(x\in [0,\frac{1}{4}]\), let \(\varphi (x)=\sin \pi x-\pi x-(8\sqrt{2}-4\pi )x^2\). Then \(\frac{d\varphi }{dx}=\pi \cos \pi x-\pi -2(8\sqrt{2}-4\pi )x\), and \(\frac{d^2\varphi }{dx^2}=-\pi ^2\sin \pi x-2(8\sqrt{2}-4\pi )\). We have \(\frac{d^2\varphi }{dx^2}|_{x=0}=-2(8\sqrt{2}-4\pi )>0\) and \(\frac{d^2\varphi }{dx^2}|_{x=\frac{1}{4}}=-\frac{\sqrt{2}}{2}\pi ^2-2(8\sqrt{2}-4\pi )<0\). Thus there exists exactly one point \(x_0 \,(0<x_0<\frac{1}{4})\) such that \(\frac{d^2\varphi }{dx^2}|_{x=x_0}=0\), since \(\frac{d^2\varphi }{dx^2}\) is strictly decreasing for \(x\in [0,\frac{1}{4}]\).
Then \(\frac{d^2\varphi }{dx^2}>0\) when \(x\in [0,x_0)\) and \(\frac{d^2\varphi }{dx^2}<0\) when \(x\in (x_0,\frac{1}{4}]\). Consequently, \(\frac{d\varphi }{dx}\) is strictly increasing for \(x\in [0,x_0]\) and is strictly decreasing for \(x\in [x_0,\frac{1}{4}]\). Therefore, we have \(\frac{d\varphi }{dx}>0\) for \(x\in (0,x_0]\) since \(\frac{d\varphi }{dx}|_{x=0}=0\). On the other hand, \(\frac{d\varphi }{dx}|_{x=\frac{1}{4}}=(\frac{\sqrt{2}}{2}+1)\pi -4\sqrt{2}<0\). Thus, there exists exactly one point \(x_1\,(x_0<x_1<\frac{1}{4})\) such that \(\frac{d\varphi }{dx}|_{x=x_1}=0\). Furthermore, \(\frac{d\varphi }{dx}>0\) for \(x\in (0,x_1)\) and \(\frac{d\varphi }{dx}<0\) for \(x\in (x_1,\frac{1}{4}]\).
Thus, \(f(x)\) is strictly increasing for \(x\in [0,x_1]\) and is strictly decreasing for \(x\in [x_1,\frac{1}{4}]\). Since \(f(0)=f(\frac{1}{4})=0\), we have \(f(x)\ge 0\) with \(x\in [0,\frac{1}{4}]\).
The proof of the case \(x\in [\frac{1}{4},\frac{1}{2}]\) is the same as that of the case \(x\in [0,\frac{1}{4}]\), and we omit its proof here.\(\square \)
Proof of Lemma 6
If \(a> 0\), then
i.e.,
Thus, we have
For the case \(a<0\), the inequality in this lemma can be similarly proved.\(\square \)
Proof of Lemma 7
Note that
by Lemma 5
for \(x\in [\frac{1}{4},\frac{1}{2}]\), where \(N_1\), \(N_2\) and \(N_3\) are defined as in Lemma 7, respectively. By Lemma 5 and the inequality (16), we have
for \(1\le j\le 2^{n-2}-1\). Thus, by Lemma 6, the sum in this lemma satisfies
Note that the real number
is the limit of the sequence
Since the sequences
are both increasing with respect to \(n\), then
This finishes the proof. \(\square \)
Proof of Lemma 8
By Lemma 5, we have
where \(N_4\) is defined as in Lemma 8. Since \(0\le \frac{j+\frac{1}{2}}{2^n-1}\le \frac{1}{4}\) for \(0\le j\le 2^{n-2}-1\), by Lemma 6 and the inequality (17), we have
Since the sequence
is decreasing with respect to \(n\), for \(n\ge 5\),
Therefore,
this completes the proof.\(\square \)
Rights and permissions
About this article
Cite this article
Li, J., Carlet, C., Zeng, X. et al. Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks. Des. Codes Cryptogr. 76, 279–305 (2015). https://doi.org/10.1007/s10623-014-9949-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-014-9949-1