On the Nonlinearity of Discrete Logarithm in \mathbb F2n\mathbb F_{2^n}

In this paper, we derive a lower bound to the nonlinearity of the discrete logarithm function in \(\mathbb F_{2^n}\) extended to a bijection in \(\mathbb F_2^n\). This function is closely related to a family of S-boxes from \(\mathbb F_2^n\) to \(\mathbb F_2^m\) proposed recently by Feng, Liao, and Yang, for which a lower bound on the nonlinearity was given by Carlet and Feng. This bound decreases exponentially with m and is therefore meaningful and proves good nonlinearity only for S-boxes with output dimension m logarithmic to n. By extending the methods of Brandstatter, Lange, and Winterhof we derive a bound that is of the same magnitude. We computed the true nonlinearities of the discrete logarithm function up to dimension n = 11 to see that, in reality, the reduction seems to be essentially smaller. We suggest that the closing of this gap is an important problem and discuss prospects for its solution.

[1]  Todd Cochrane.  On a trigonometric inequality of vinogradov , 1987 .

[2]  Josef Pieprzyk,et al.  Advances in Cryptology - ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings , 2008, ASIACRYPT.

[3]  Tor Helleseth,et al.  Advances in Cryptology — EUROCRYPT ’93 , 2001, Lecture Notes in Computer Science.

[4]  Jing Yang,et al.  Maximal values of generalized algebraic immunity , 2009, Des. Codes Cryptogr..

[5]  Yeow Meng Chee,et al.  Coding and Cryptology, Second International Workshop, IWCC 2009, Zhangjiajie, China, June 1-5, 2009. Proceedings , 2009, IWCC.

[6]  Claude Carlet,et al.  An Infinite Class of Balanced Vectorial Boolean Functions with Optimum Algebraic Immunity and Good Nonlinearity , 2009, IWCC.

[7]  Tanja Lange,et al.  Linear Complexity of the Discrete Logarithm , 2003, Des. Codes Cryptogr..

[8]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[9]  Tanja Lange,et al.  On the Non-linearity and Sparsity of Boolean Functions Related to the Discrete Logarithm in Finite Fields of Characteristic Two , 2005, WCC.

[10]  Rudolf Lide,et al.  Finite fields , 1983 .

[11]  Kaisa Nyberg,et al.  Differentially Uniform Mappings for Cryptography , 1994, EUROCRYPT.

[12]  Claude Carlet,et al.  An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity , 2008, ASIACRYPT.