Abstract
AbstractLet E1 and E2 be ordinary elliptic curves over a finite field Fp such that #E1(Fp) = #E2(Fp). Tate's isogeny theorem states that there is an isogeny from E1 to E2 which is defined over Fp. The goal of this paper is to describe a probabilistic algorithm for constructing such an isogeny.The algorithm proposed in this paper has exponential complexity in the worst case. Nevertheless, it is efficient in certain situations (that is, when the class number of the endomorphism ring is small). The significance of these results to elliptic curve cryptography is discussed.
Subject
Computational Theory and Mathematics,General Mathematics
Reference35 articles.
1. Endomorphisms of abelian varieties over finite fields
2. The arithmetic of elliptic curves;Silverman;Grad,1986
3. 31. Shimura G. , Introduction to the arithmetic theory of automorphic functions (Iwanami/Princeton, 1971).
4. Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
5. ‘Elliptic curves over finite fields and the computation of square roots mod p’;Schoof;Math. Comp.,1985
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献