The Generalized Weil Pairing and the Discrete Logarithm Problem on Elliptic Curves
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, which is efficient for curves with trace of Frobenius congruent to 2modulo the order of the base point. The reduction is as simple to construct as that of Menezes, Okamoto, and Vanstone , and is provably equivalent to that of Frey and Rück .
KeywordsElliptic Curve Elliptic Curf Prime Order Discrete Logarithm Elliptic Curve Cryptography
Unable to display preview. Download preview PDF.
- 1.L.M. Adleman. A subexponential algorithm for the discrete logarithm problem with applications to cryptography. In Proc. 20th IEEE Found. Comp. Sci. Symp., pages 55–60, 1979.Google Scholar
- 5.I. Blake, G. Seroussi, and N. Smart. Elliptic curves in Cryptography, volume 265 of London Mathematical Society, Lecture Note Series. Cambridge University Press, 1999.Google Scholar
- 17.V. S. Miller. Uses of elliptic curves in cryptography. In Hugh C. Williams, editor, Advances in cryptology-CRYPTO’ 85: proceedings, volume 218 of Lecture Notes in Computer Science, pages 417–426. Springer-Verlag, 1986.Google Scholar
- 19.J. H. Silverman. The Arithmetic of Elliptic Curves, volume 106 of Graduate Texts in Mathematics. Springer-Verlag, 1986.Google Scholar