Interpolation of the elliptic curve Diffie-Hellman mapping

Authors:
Tanja Lange;Arne Winterhof
Affiliations:
Information Security and Cryptology, Ruhr-University of Bochum, Bochum, Germany;Temasek Laboratories, National University of Singapore, Singapore, Republic of Singapore
Venue:
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Year:
2003

Citing 7
Cited 7

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Algorithmic number theory

Algorithmic number theory
The Diffie–Hellman Protocol

Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

SIAM Journal on Computing
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)

Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)

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

Discrete Applied Mathematics - Special issue: Coding and cryptography
Interpolation of the Double Discrete Logarithm

WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem

Discrete Applied Mathematics - Special issue: Coding and cryptography
Interpolation of functions related to the integer factoring problem

WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
On degrees of polynomial interpolations related to elliptic curve cryptography

WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Polynomial approximation of bilinear Diffie--Hellman maps

Finite Fields and Their Applications
Polynomial representations of the Lucas logarithm

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove lower bounds on the degree of polynomials interpolating the Diffie-Hellman mapping for elliptic curves over finite fields and some related mappings including the discrete logarithm. Our results support the assumption that the elliptic curve Diffie-Hellman key exchange and related cryptosystems are secure.