Polynomial representations of the Diffie-Hellman mapping

DOI10.1017/S0004972700019547zbMath0974.11040MaRDI QIDQ2730746

Edwin D. El-Mahassni, Igor E. Shparlinski

Publication date: 16 December 2001

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

zbMATH Keywords

cryptographycomplexity lower boundsDiffie-Hellman key exchangeDiffie-Hellman decision problem

Mathematics Subject Classification ID

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

Related Items (10)

Polynomial interpolation of the Naor-Reingold pseudo-random function ⋮ Studying the performance of artificial neural networks on problems related to cryptography ⋮ 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 interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem ⋮ Polynomial representations of the Lucas logarithm ⋮ Transformations of Cryptographic Schemes Through Interpolation Techniques ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems ⋮ On the index of the Diffie-Hellman mapping

Cites Work

• Unnamed Item
• Number theoretic methods in cryptography. Complexity lower bounds
• On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
• The Diffie-Hellman protocol
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

This page was built for publication: Polynomial representations of the Diffie-Hellman mapping