Abstract
In this note, we deduce a bound between fast algebraic immunity and higher order nonlinearity (it is the first time that a bound between these two cryptographic criteria is given), and find that a Boolean function should have high r-order nonlinearity to resist fast algebraic attacks. As a corollary, we find that no matter how much effort we make, the Tu-Deng functions cannot be repaired in a standard way to behave well against fast algebraic attacks. Therefore, we should give up repairing this class of Boolean functions and try to find other classes of functions with good cryptographic properties or to prove that the Carlet-Feng function behaves well.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Braeken, A., Preneel, B.: On the algebraic immunity of symmetric Boolean functions. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol. 3797, pp. 35–48. Springer, Heidelberg (2005)
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(7), 3105–3121 (2006)
Dalai, D.K., Gupta, K.C., Maitra, S.: Cryptographically Significant Boolean Functions: Construction and Analysis in Terms of Algebraic Immunity. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 98–111. Springer, Heidelberg (2005)
Dalai, D.K., Maitra, S., Sarkar, S.: Basic theory in construction of Boolean functions with maximum possible annihilator immunity. Des. Codes Cryptogr. 40(1), 41–58 (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)
Pasalic, E.: Almost Fully Optimized Infinite Classes of Boolean Functions Resistant to (Fast) Algebraic Cryptanalysis. In: Lee, P.J., Cheon, J.H. (eds.) ICISC 2008. LNCS, vol. 5461, pp. 399–414. Springer, Heidelberg (2009)
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)
Tu, Z., Deng, Y.: A Conjecture on Binary String and its Application on constructing Boolean Functions of Optimal Algebraic Immunity. Des. Codes Cryptogr., Online First Articles. doi: 10.1007/s10623-010-9413-9 (2010)
Carlet, C.: On a weakness of the Tu-Deng function and its repair. Cryptology ePrint Archive, 2009/606, http://eprint.iacr.org/
Courtois, N.T.: Higher order correlation attacks,XL algorithm and cryptanalysis of toyocrypt. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp. 182–199. Springer, Heidelberg (2003)
Golić, J.D.: Fast low order approximation of cryptographic functions. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 268–282. Springer, Heidelberg (1996)
Knudsen, L.R., Robshaw, M.J.B.: Non-linear approximations in linear cryptanalysis. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 224–236. Springer, Heidelberg (1996)
Iwata, T., Kurosawa, K.: Probabilistic higher order differential attack and higher order bent functions. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 62–74. Springer, Heidelberg (1999)
Carlet, C.: On the higher order nonlinearities of algebraic immune functions. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 584–601. Springer, Heidelberg (2006)
Carlet, C., Mesnager, S.: Improving the Upper Bounds on the Covering Radii of Binary Reed-Muller Codes. IEEE Trans. Inf. Theory 53(1), 162–173 (2007)
Carlet, C.: Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applications. IEEE Trans. Inf. Theory 54(3), 1262–1272 (2008)
Lobanov, M.S.: Tight bounds between algebraic immunity and nonlinearities of high orders. Cryptology ePrint Archive 2007/444, http://eprint.iacr.org/
Carlet, C.: On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations. In: Golomb, S.W., Parker, M.G., Pott, A., Winterhof, A. (eds.) SETA 2008. LNCS, vol. 5203, pp. 345–367. Springer, Heidelberg (2008)
Mesnager, S.: Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity. IEEE Trans. Inf. Theory 54(8), 3656–3662 (2008)
Braeken, A.: Cryptographic properties of Boolean functions and S-boxes. Ph. D. thesis, Katholieke Universiteit Leuven, Belgium (2006), http://www.cosic.esat.kuleuven.be/publications/thesis-129.pdf
Meier, W., Staffelbach, O.: Fast correlation attacks on stream ciphers. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 301–314. Springer, Heidelberg (1988)
Johansson, T., Jönsson, F.: Fast Correlation Attacks through Reconstruction of Linear Polynomials. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 300–315. Springer, Heidelberg (2000)
Hawkes, P., Rose, G.G.: Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 390–406. Springer, Heidelberg (2004)
Rothaus, O.S.: On bent functions. J. Comb. Theory A20(3), 300–305 (1976)
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)
Liu, M., Lin, D.: Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions. ArXiv: 0910.4632v1 [cs.CR]
Courtois, N.: Fast Algebraic attacks on stream ciphers with linear feedback. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 176–194. Springer, Heidelberg (2003)
Cusick, T.W., Li, Y., Stanica, P.: On a combinatoric conjectur. Cryptology ePrint Archive, 2009/554, http://eprint.iacr.org/
Flori, J.P., Randriambololona, H., Cohen, G., Mesnager, S.: On a conjecture about binary strings distribution. Cryptology ePrint Archive, 2010/170, http://eprint.iacr.org/
Lobanov, M.S.: Tight bound between nonlinearity and algebraic immunity. Cryptology ePrint Archive, 2005/441, http://eprint.iacr.org/
Rønjom, S., Helleseth, T.: A New Attack on the Filter Generator. IEEE Trans. Inf. Theory 53(5), 1752–1758 (2007)
Wang, Q., Peng, J., Kan, H., Xue, X.: Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials. IEEE Trans. Inf. Theory 56(6), 3048–3053 (2010)
Carlet, C.: Boolean Functions for Cryptography and Error Correcting Codes. In: Chapter of the Monography “Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 257–397. Cambridge University Press, Cambridge (2010), http://www-roc.inria.fr/secret/Claude.Carlet/pubs.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Q., Johansson, T. (2011). A Note on Fast Algebraic Attacks and Higher Order Nonlinearities. In: Lai, X., Yung, M., Lin, D. (eds) Information Security and Cryptology. Inscrypt 2010. Lecture Notes in Computer Science, vol 6584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21518-6_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-21518-6_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21517-9
Online ISBN: 978-3-642-21518-6
eBook Packages: Computer ScienceComputer Science (R0)