Polynomial approximation of bilinear Diffie-Hellman maps

DOI10.1016/j.ffa.2007.03.002zbMath1141.11034OpenAlexW2137465039MaRDI QIDQ2426464

Theo Garefalakis, Ian F. Blake

Publication date: 22 April 2008

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2007.03.002

zbMATH Keywords

elliptic curvespolynomial interpolationWeil pairing

Mathematics Subject Classification ID

Elliptic curves over global fields (11G05) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (2)

Closed formulae for the Weil pairing inversion ⋮ On the index of the Diffie-Hellman mapping

Cites Work

• The generalized Weil pairing and the discrete logarithm problem on elliptic curves
• On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
• The Diffie-Hellman protocol
• Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem
• Polynomial representations of the Diffie-Hellman mapping
• On Polynomial Interpolations related to Verheul Homomorphisms
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• Reducing elliptic curve logarithms to logarithms in a finite field
• The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
• Identity-Based Encryption from the Weil Pairing
• Information Security and Privacy
• Simplified pairing computation and security implications
• Advances in Elliptic Curve Cryptography
• Coding and Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial approximation of bilinear Diffie-Hellman maps