|
This article is cited in 2 scientific papers (total in 2 papers)
On the computation of logarithms on elliptic curves
I. A. Semaev
Abstract:
We consider the problem of solving an exponential equation over
a cyclic subgroup of order $m$ of the group $E$ of points
of an elliptic curve over the finite field $F_q$. We prove that if $F_{q_1}$
is a minimal extension of $F_q$ such that the subgroup of the points rational
over $F_{q_1}$ of the group $E$ contains a subgroup isomorphic to
$\Z/m\times\Z/m$, then the complexity of solving the equation
mentioned above is no greater than the complexity of computing logarithms
in the field $F_{q_1}$ or the complexity of $O(\ln m)$ arithmetic operations
in that field. Thus, the computing of logarithms on elliptic curves is reduced
to the computing of logarithms in a finite field. By a different approach,
this result was obtained by Menezes, Okamoto, and Vanstone.
Received: 23.11.1992
Citation:
I. A. Semaev, “On the computation of logarithms on elliptic curves”, Diskr. Mat., 8:1 (1996), 65–71; Discrete Math. Appl., 6:1 (1996), 69–76
Linking options:
https://www.mathnet.ru/eng/dm516https://doi.org/10.4213/dm516 https://www.mathnet.ru/eng/dm/v8/i1/p65
|
Statistics & downloads: |
Abstract page: | 1662 | Full-text PDF : | 926 | First page: | 1 |
|