Abstract
In public-key cryptography the discrete logarithm has gained increasing interest as a one-way function. This paper deals with the particularly interesting case of the discrete logarithm in finite fields of characteristic two.
We obtain bounds on the maximal Fourier coefficient, i.e., on the non-linearity, on the degree and the sparsity of Boolean functions interpolating the discrete logarithm in finite fields of characteristic two. These bounds complement earlier results for finite fields of odd characteristic.
The proofs of the results for odd characteristic involve quadratic character sums and are not directly extendable to characteristic two. Here we use a compensation for dealing with the quadratic character.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brandstätter, N., Winterhof, A.: Approximation of the discrete logarithm in finite fields of even characteristic by real polynomials. Arch. Math. (Brno) (to appear)
Carlet, C.: On Cryptographic Complexity of Boolean Functions. In: Finite Fields with Applications to Coding Theory, Cryptography and Related Areas, pp. 53–69. Springer, Berlin (2002)
Carlet, C.: On the degree, nonlinearity, algebraic thickness, and nonnormality of Boolean functions with developments on symmetric functions. IEEE Trans. Inform. Theory 50, 2178–2185 (2004)
Carlet, C., Ding, C.: Highly nonlinear mappings. J. Compl. 20, 205–244 (2004)
Carlet, C., Sarkar, P.: Spectral domain analysis of correlation immune and resilient Boolean functions. Finite Fields and Their Appl. 8, 120–130 (2002)
Carlet, C., Tarannikov, Y.: Covering sequences of Boolean functions and their cryptographic significance. Designs, Codes and Cryptography 25, 263–279 (2002)
Cochrane, T.: On a trigonometric inequality of Vinogradov. J. Number Theory 27, 9–16 (1987)
Lange, T., Winterhof, A.: Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions. Acta Arith. 101, 223–229 (2002)
Lange, T., Winterhof, A.: Interpolation of the discrete logarithm in \(F\sb q\) by Boolean functions and by polynomials in several variables modulo a divisor of q − 1. Discrete Appl. Math. 128, 193–206 (2003)
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)
Schmidt, W.M.: Equations over finite fields. Lect. Notes Math., vol. 536. Springer, Berlin (1976)
Shparlinski, I.E.: Number Theoretic Methods in Cryptography. Birkhäuser, Basel (1999)
Shparlinski, I.E.: Cryptographic Applications of Analytic Number Theory. Complexity lower bounds and pseudorandomness. Birkhäuser, Basel (2003)
Štanikǎ, P.: Nonlinearity, local and global avalanche characteristics of balanced Boolean functions. Discr. Math. 248, 181–193 (2002)
Winterhof, A.: Incomplete additive character sums and applications. In: Jungnickel, D., Niederreiter, H. (eds.) Finite fields and applications, pp. 462–474. Springer, Heidelberg (2001)
Zheng, Y., Zhang, X.M.: Connections among nonlinearity, avalanche and correlation immunity. Theor. Comp. Sci. 292, 697–710 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brandstätter, N., Lange, T., Winterhof, A. (2006). On the Non-linearity and Sparsity of Boolean Functions Related to the Discrete Logarithm in Finite Fields of Characteristic Two. In: Ytrehus, Ø. (eds) Coding and Cryptography. WCC 2005. Lecture Notes in Computer Science, vol 3969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779360_11
Download citation
DOI: https://doi.org/10.1007/11779360_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35481-9
Online ISBN: 978-3-540-35482-6
eBook Packages: Computer ScienceComputer Science (R0)