Reducing Certain Elliptic Curve Discrete Logarithms to Logarithms in a Finite Field

Authors:
Kyungah Shim
Affiliations:
-
Venue:
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Year:
2001

Citing 3
Cited 0

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves

Mathematics of Computation
Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p

Mathematics of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We construct a variant of Weil pairing to reduce the elliptic curve discrete logarithm problem to the discrete logarithm problem in the multiplicative subgroup of a finite field. We propose an explicit reduction algorithm using a new pairing and apply the algorithm to the case of two trace elliptic curves.