A polynomial representation of the Diffie-Hellman mapping

DOI10.1007/S00200-002-0104-2zbMath1013.94012OpenAlexW1979198198MaRDI QIDQ1861170

Wilfried Meidl, Arne Winterhof

Publication date: 13 March 2003

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-002-0104-2

zbMATH Keywords

degreesparsitypolynomial interpolationDiffie-Hellman cryptosystem

Mathematics Subject Classification ID

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

Related Items (7)

On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping ⋮ Interpolation of the Double Discrete Logarithm ⋮ 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 ⋮ Aitken and Neville inverse interpolation methods for the Lucas logarithm problem ⋮ On the index of the Diffie-Hellman mapping

This page was built for publication: A polynomial representation of the Diffie-Hellman mapping