A note on the interpolation of the Diffie-Hellman mapping

DOI10.1017/S0004972700019936zbMath0997.11108OpenAlexW2078361794MaRDI QIDQ2777722

Arne Winterhof

Publication date: 12 November 2002

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700019936

zbMATH Keywords

cryptographydiscrete logarithm problem

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Polynomials over finite fields (11T06)

Related Items (7)

Polynomial interpolation of the Naor-Reingold pseudo-random function ⋮ Studying the performance of artificial neural networks on problems related to cryptography ⋮ Interpolation of the Double Discrete Logarithm ⋮ Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions ⋮ Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem ⋮ Polynomial representations of the Lucas logarithm ⋮ On the index of the Diffie-Hellman mapping

Cites Work

• Number theoretic methods in cryptography. Complexity lower bounds
• On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.

This page was built for publication: A note on the interpolation of the Diffie-Hellman mapping