Hostname: page-component-848d4c4894-4rdrl Total loading time: 0 Render date: 2024-07-04T14:13:40.009Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on the interpolation of the Diffie-Hellman mapping

Published online by Cambridge University Press:  17 April 2009

Arne Winterhof
Arne Winterhof
Affiliation:
Institute of Discrete Mathematics, Austrian Academy of Sciences, Sonnenfelsgasse 19/2, A-1010 Vienna, Austria e-mail: arne.winterhof@oeaw.ac.at
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We obtain lower bounds on the degrees of polynomials representing the Diffie-Hellman mapping f (γx, γy) = γxy, where γ is a nonzero element of Fq of order d, x runs through a subset of [0,d – 1], and y runs through a set of consecutive integers.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 64 , Issue 3 , December 2001 , pp. 475 - 477
Copyright
Copyright © Australian Mathematical Society 2001

References

[1]Coppersmith, D. and Shparlinski, I., ‘On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping’, J. Cryptology 13 (2000), 339–360.CrossRefGoogle Scholar
[2]El Mahassni, E. and Shparlinski, I., ‘Polynomial representations of the Diffie-Hellman mapping’, Bull. Austral. Math. Soc. 63 (2001), 467–473.CrossRefGoogle Scholar
[3]Meidl, W. and Winterhof, A., ‘A polynomial representation of the Diffie-Hellman mapping’, (preprint).Google Scholar
[4]Menezes, A.J., van Oorschot, P.C. and Vanstone, S.A., Handbook of applied cryptography (CRC Press, Boca Raton, 1997).Google Scholar
[5]Shparlinski, I.E., Number theoretic methods in cryptography (Birkhäuser, Basel, 1999).CrossRefGoogle Scholar