Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions

DOI10.4064/aa101-3-3zbMath0998.11070OpenAlexW2069148963MaRDI QIDQ2773333

Arne Winterhof, Tanja Lange

Publication date: 21 February 2002

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/aa101-3-3

zbMATH Keywords

degreelower boundsBoolean functionsparsitydiscrete logarithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Exponential sums (11T23)

Related Items (6)

Interpolation of the Double Discrete Logarithm ⋮ Boolean functions derived from Fermat quotients ⋮ Polynomial representations of the Lucas logarithm ⋮ A large family of Boolean functions ⋮ Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\). ⋮ Measures of pseudorandomness for binary sequences constructed using finite fields

This page was built for publication: Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions