The generalized Weil pairing and the discrete logarithm problem on elliptic curves

DOI10.1016/j.tcs.2003.06.002zbMath1057.94018OpenAlexW2122177483MaRDI QIDQ596141

Theodoulos Garefalakis

Publication date: 10 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.06.002

zbMATH Keywords

elliptic curvescryptographyWeil pairing, discrete logarithm problem

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52)

Related Items (1)

Polynomial approximation of bilinear Diffie-Hellman maps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Function field sieve method for discrete logarithms over finite fields
• The index calculus method using non-smooth polynomials
• Fast evaluation of logarithms in fields of characteristic two
• Computing Logarithms in Finite Fields of Characteristic Two
• Elliptic Curve Cryptosystems
• Comparing the MOV and FR Reductions in Elliptic Curve Cryptography
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Reducing elliptic curve logarithms to logarithms in a finite field
• The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve

This page was built for publication: The generalized Weil pairing and the discrete logarithm problem on elliptic curves