Polynomial approximation of bilinear Diffie--Hellman maps

Authors:
Ian F. Blake;Theo Garefalakis
Affiliations:
Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON M5S 3G4, Canada;Department of Mathematics, University of Crete, 71409 Heraklion, Greece
Venue:
Finite Fields and Their Applications
Year:
2008

Citing 12
Cited 1

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
Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
A One Round Protocol for Tripartite Diffie-Hellman

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
The generalized Weil pairing and the discrete logarithm problem on elliptic curves

Theoretical Computer Science - Latin American theorotical informatics
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 elliptic curve Diffie-Hellman mapping

AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Aggregate and verifiably encrypted signatures from bilinear maps

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
On degrees of polynomial interpolations related to elliptic curve cryptography

WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems

IEEE Transactions on Information Theory
Reducing elliptic curve logarithms to logarithms in a finite field

IEEE Transactions on Information Theory

Closed formulae for the Weil pairing inversion

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of computing bilinear Diffie-Hellman maps is considered. It is shown that the problem of computing the map is equivalent to computing a diagonal version of it. Various lower bounds on the degree of any polynomial that interpolates this diagonal version of the map are found that shows that such an interpolation will involve a polynomial of large degree, relative to the size of the set on which it interpolates.