Quadratic Equations from a Kind of S-boxes

Algebraic attack studies ciphers from the point of view of solving equations. It is important to measure the security of block ciphers how many linearly independent bi-affine or quadratic equations they satisfy. As the S-box is the main nonlinear part of block ciphers, it really makes sense to get the number of linearly independent bi-affine and quadratic equations that an S-box satisfies to analyse the security of block ciphers. The article answers this question for two S-boxes based on APN power functions, and shows how to find out the equations by two toy examples. The techniques can be generalized to other S-boxes constructed by power functions. According to these conclusions, we can estimate the safety of such kind of block ciphers.

[1]  Gerhard Goos,et al.  Fast Software Encryption , 2001, Lecture Notes in Computer Science.

[2]  Dong Hoon Lee,et al.  Quadratic Equations from APN Power Functions , 2006, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[3]  Dong Hoon Lee,et al.  Resistance of S-Boxes against Algebraic Attacks , 2004, FSE.

[4]  Steve Babbage,et al.  Cryptanalysis of LILI-128 , 2001 .

[5]  Josef Pieprzyk,et al.  Cryptanalysis of Block Ciphers with Overdefined Systems of Equations , 2002, ASIACRYPT.

[6]  Hideki Imai,et al.  Cryptanalysis of TOYOCRYPT-HS1 Stream Cipher , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[7]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: List of Symbols , 1986 .

[8]  Hans Dobbertin,et al.  Almost Perfect Nonlinear Power Functions on GF(2n): The Niho Case , 1999, Inf. Comput..

[9]  Yuliang Zheng,et al.  Advances in Cryptology — ASIACRYPT 2002 , 2002, Lecture Notes in Computer Science.

[10]  Guang Gong,et al.  Upper Bounds on Algebraic Immunity of Boolean Power Functions , 2006, FSE.

[11]  Amr M. Youssef,et al.  Hyper-bent Functions , 2001, EUROCRYPT.

[12]  Hans Dobbertin,et al.  Almost Perfect Nonlinear Power Functions on GF(2n): The Welch Case , 1999, IEEE Trans. Inf. Theory.

[13]  Nicolas Courtois.  Fast Algebraic Attacks on Stream Ciphers with Linear Feedback , 2003, CRYPTO.

[14]  Aggelos Kiayias,et al.  Traceable Signatures , 2004, EUROCRYPT.

[15]  Claude Carlet,et al.  Algebraic Attacks and Decomposition of Boolean Functions , 2004, EUROCRYPT.

[16]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[17]  Nicolas Courtois,et al.  On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions , 2006, ACISP.