Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
From MaRDI portal
Publication:1811103
DOI10.1016/S0166-218X(02)00445-6zbMath1039.94007OpenAlexW2067307917MaRDI QIDQ1811103
Publication date: 10 June 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00445-6
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
Polynomial interpolation of the Naor-Reingold pseudo-random function ⋮ Interpolation of the Double Discrete Logarithm ⋮ Boolean functions derived from Fermat quotients ⋮ Closed formulae for the Weil pairing inversion ⋮ Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions ⋮ Polynomial representations of the Lucas logarithm ⋮ A large family of Boolean functions ⋮ Aitken and Neville inverse interpolation methods for the Lucas logarithm problem ⋮ On Polynomial Interpolations related to Verheul Homomorphisms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of Boolean functions with linear combinational complexity
- Equations over finite fields. An elementary approach
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
- On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs
- Incomplete character sums and polynomial interpolation of the discrete logarithm
- Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions
- Constant depth circuits, Fourier transform, and learnability
- Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Reducing elliptic curve logarithms to logarithms in a finite field
- A polynomial representation for logarithms in GF(q)
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- Some estimates for character sums and applications
- Polynomial interpolation of the discrete logarithm
This page was built for publication: Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
