Results 1 
1 of
1
Generalizing the MenezesOkamotoVanstone (MOV) algorithm to nonsupersingular elliptic curves
 IN SYMPOSIUM ON CRYPTOGRAPHY AND INFORMATION SECURITY 1999 (SCIS '99
, 1999
"... We address the MenezesOkamotoVanstone (MOV) algorithm for attacking elliptic curve cryptosystems which is completed in subexponential time for supersingular elliptic curves. There exist two hurdles to clear, from an algorithmic point of view, in applying the MOV reduction to general elliptic curve ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We address the MenezesOkamotoVanstone (MOV) algorithm for attacking elliptic curve cryptosystems which is completed in subexponential time for supersingular elliptic curves. There exist two hurdles to clear, from an algorithmic point of view, in applying the MOV reduction to general elliptic curves: the problem of explicitly determining the minimum extension degree k such that E[n] E(Fqk) and that of efficiently nding an ntorsion point needed to evaluate the Weil pairing, where n is the order of a cyclic group of the elliptic curve discrete logarithm problem. We can nd an answer to the rst problem in a recent paper by Balasubramanian and Koblitz. On the other hand, the second problem is important as well, since the reduction might require exponential time even for small k. In this paper, we actually construct a novel method of efficiently nding an ntorsion point, which leads to a solution of the second problem. In addition, our contribution allows us to draw the conclusion that the MOV reduction is indeed as powerful as the FreyRuck reduction under n 6 jq 0 1, not only from the viewpoint of the minimum extension degree but also from that of the effectiveness of algorithms.