Abstract
Purchase PDF (240 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (1)
Purchase PDF (416 K)
]
doi:10.1016/j.tcs.2003.06.002 
Copyright © 2003 Elsevier B.V. All rights reserved.
The generalized Weil pairing and the discrete logarithm problem on elliptic curves
Theodoulos Garefalakis
Received 5 August 2002;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We review the construction of a generalization of the Weil pairing, which is non-degenerate and bilinear, and use it to construct a reduction from the discrete logarithm problem on elliptic curves to the discrete logarithm problem in finite fields. We show that the new pairing can be computed efficiently for curves with trace of Frobenius congruent to 2 modulo the order of the base point. This leads to an efficient reduction for this class of curves. The reduction is as simple to construct as that of Menezes et al. (IEEE Trans. Inform. Theory, 39, 1993), and is provably equivalent to that of Frey and Rück (Math. Comput. 62 (206) (1994) 865).
Author Keywords: Elliptic curves; Cryptography; Discrete Logarithm Problem
