Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem

DOI10.1016/j.dam.2005.03.030zbMath1092.94024OpenAlexW2090900392WikidataQ59163776 ScholiaQ59163776MaRDI QIDQ2489927

Eike Kiltz, Arne Winterhof

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.03.030

zbMATH Keywords

lower bounds

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials over finite fields (11T06) Congruences; primitive roots; residue systems (11A07)

Related Items (9)

Polynomial interpolation of the Naor-Reingold pseudo-random function ⋮ Polynomial approximation of bilinear Diffie-Hellman maps ⋮ Interpolation of the Double Discrete Logarithm ⋮ Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions ⋮ Polynomial representations of the Lucas logarithm ⋮ Aitken and Neville inverse interpolation methods for the Lucas logarithm problem ⋮ On the index of the Diffie-Hellman mapping ⋮ Compact hierarchical identity-based encryption based on a harder decisional problem ⋮ Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short proof for explicit formulas for discrete logarithms in finite fields
• A note on discrete logarithms in finite fields
• Number theoretic methods in cryptography. Complexity lower bounds
• On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
• Incomplete character sums and polynomial interpolation of the discrete logarithm
• On the linear complexity profile of explicit nonlinear pseudorandom numbers.
• A polynomial representation of the Diffie-Hellman mapping
• Prime divisors of sparse integers
• Polynomial representations of the Diffie-Hellman mapping
• A note on the interpolation of the Diffie-Hellman mapping
• A polynomial form for logarithms modulo a prime (Corresp.)
• On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping
• A polynomial representation for logarithms in GF(q)
• Polynomial interpolation of the discrete logarithm

This page was built for publication: Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem