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.
|Title of host publication||Coding and cryptography international workshop, WCC'05, Bergen, Norway, March 14-18, 2005 : revised selected papers)|
|Place of Publication||Berlin|
|Publication status||Published - 2006|
|Name||Lecture Notes in Computer Science|