Incomplete character sums and polynomial interpolation of the discrete logarithm
DOI10.1006/FFTA.2001.0334zbMATH Open1017.11065OpenAlexW2006337912MaRDI QIDQ1609397FDOQ1609397
Authors: 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
Recommendations
- Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions
- Polynomial interpolation of the discrete logarithm
- An estimate of incomplete multiplicative character sum of polynomials
- Polynomial Interpolation of the k-th Root of the Discrete Logarithm
- Publication:3497158
- Exponential sums with polynomial values of the discrete logarithm
- scientific article; zbMATH DE number 691483
- Approximation of the discrete logarithm in finite fields of even characteristic by real polynomials.
- Interpolation of the discrete logarithm in finite fields by Boolean functions
- scientific article; zbMATH DE number 495708
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other character sums and Gauss sums (11T24) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Equations over finite fields. An elementary approach
- Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
- On the distribution of inversive congruential pseudorandom numbers in parts of the period
- On the distribution of powers in finite fields
- A polynomial representation for logarithms in GF(q)
- A short proof for explicit formulas for discrete logarithms in finite fields
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
- Polynomial interpolation of the discrete logarithm
- Title not available (Why is that?)
- Number theoretic methods in cryptography. Complexity lower bounds
Cited In (9)
- Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
- Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
- Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions
- Aitken and Neville inverse interpolation methods for the Lucas logarithm problem
- Polynomial representations of the Lucas logarithm
- Fourier analysis and expanding phenomena in finite fields
- On zero-testing and interpolation of sums of characters
- Interpolation of the Double Discrete Logarithm
- Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem
This page was built for publication: Incomplete character sums and polynomial interpolation of the discrete logarithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609397)
