Incomplete character sums and polynomial interpolation of the discrete logarithm

DOI10.1006/ffta.2001.0334zbMath1017.11065OpenAlexW2006337912MaRDI QIDQ1609397

Harald Niederreiter, Arne Winterhof

Publication date: 15 August 2002

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.2001.0334

zbMATH Keywords

finite fieldsincomplete character sumspolynomial interpolation of the discrete logarithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Other character sums and Gauss sums (11T24)

Related Items

Interpolation of the Double Discrete Logarithm, Fourier analysis and expanding phenomena in finite fields, Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem, Polynomial representations of the Lucas logarithm, Aitken and Neville inverse interpolation methods for the Lucas logarithm problem, Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).

Cites Work

• Unnamed Item
• A short proof for explicit formulas for discrete logarithms in finite fields
• Equations over finite fields. An elementary approach
• On the distribution of powers in finite fields
• Number theoretic methods in cryptography. Complexity lower bounds
• On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
• On the distribution of inversive congruential pseudorandom numbers in parts of the period
• Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
• A polynomial representation for logarithms in GF(q)
• Polynomial interpolation of the discrete logarithm