On the non-linearity and sparsity of boolean functions related to the discrete logarithm in finite fields of characteristic two

Authors:
Nina Brandstätter;Tanja Lange;Arne Winterhof
Affiliations:
Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Linz, Austria;Department of Mathematics, Technical University of Denmark, Kongens Lyngby, Denmark;Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Linz, Austria
Venue:
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Year:
2005

Citing 8
Cited 5

Handbook of Applied Cryptography

Handbook of Applied Cryptography
Covering Sequences of Boolean Functions and Their Cryptographic Significance

Designs, Codes and Cryptography
Nonlinearity, local snd global avalanche characteristics of balanced Boolean functions

Discrete Mathematics
Connections among nonlinearity, avalanche and correlation immunity

Theoretical Computer Science - Algorithms,automata, complexity and games
Interpolation of the discrete logarithm in Fq by Boolean functions and by polynomials in several variables modulo a divisor of q - 1

Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Highly nonlinear mappings

Journal of Complexity - Special issue on coding and cryptography
On the degree, nonlinearity, algebraic thickness, and nonnormality of Boolean functions, with developments on symmetric functions

IEEE Transactions on Information Theory
Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions

Finite Fields and Their Applications

Interpolation of the Double Discrete Logarithm

WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
On the nonlinearity of discrete logarithm in F2n

SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Boolean functions derived from Fermat quotients

Cryptography and Communications
Boolean functions derived from pseudorandom binary sequences

SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
"Provable" security against differential and linear cryptanalysis

FSE'12 Proceedings of the 19th international conference on Fast Software Encryption

Quantified Score

Hi-index	0.00

Visualization

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.