On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.

DOI10.1007/s001450010002zbMath1038.94007OpenAlexW1978262582MaRDI QIDQ1573770

Don Coppersmith, Igor E. Shparlinski

Publication date: 8 August 2000

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001450010002

zbMATH Keywords

character sums polynomial approximations discrete logarithm boolean functions Diffie-Hellman cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Estimates on character sums (11L40)

Related Items (25)

Polynomial interpolation of the Naor-Reingold pseudo-random function ⋮ On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping ⋮ Studying the performance of artificial neural networks on problems related to cryptography ⋮ Polynomial approximation of bilinear Diffie-Hellman maps ⋮ Homomorphic public-key cryptosystems and encrypting Boolean circuits ⋮ Interpolation of the Double Discrete Logarithm ⋮ Permutation polynomials with Carlitz rank 2 ⋮ Polynomial representations of the Diffie-Hellman mapping ⋮ Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography ⋮ Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions ⋮ On the statistical properties of Diffie-Hellman distributions ⋮ Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem ⋮ Short cycles in repeated exponentiation modulo a prime ⋮ A note on the interpolation of the Diffie-Hellman mapping ⋮ Polynomial representations of the Lucas logarithm ⋮ A large family of Boolean functions ⋮ Transformations of Cryptographic Schemes Through Interpolation Techniques ⋮ 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\). ⋮ On the index of the Diffie-Hellman mapping ⋮ Public-key cryptography and invariant theory ⋮ On non-Abelian homomorphic public-key cryptosystems ⋮ Circuit and decision tree complexity of some number theoretic problems ⋮ Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function ⋮ Incomplete character sums and polynomial interpolation of the discrete logarithm

This page was built for publication: On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.