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

N. Brandstätter, T. Lange, A. Winterhof

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

10 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationCoding and cryptography international workshop, WCC'05, Bergen, Norway, March 14-18, 2005 : revised selected papers)
EditorsØ. Ytrehus
Place of PublicationBerlin
PublisherSpringer
Pages135-143
ISBN (Print)3-540-35481-6
DOIs
Publication statusPublished - 2006

Publication series

NameLecture Notes in Computer Science
Volume3969
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'On the non-linearity and sparsity of Boolean functions related to the discrete logarithm in finite fields of characteristic two'. Together they form a unique fingerprint.

Cite this