We present two algorithms to compute the endomorphism ring of an ordinary elliptic curve E defined over a finite field Fq. Under suitable heuristic assumptions, both have subexponential complexity. We bound the complexity of the first algorithm in terms of log q, while our bound for the second algorithm depends primarily on log IDEI, where DE is the discriminant of the order isomorphic to End(E). As a byproduct, our method yields a short
certificate that may be used to verify that the endomorphism ring is as claimed.
|Number of pages||16|
|Publication status||Published - 2009|
|Name||Cryptology ePrint Archive|