Title :
Fast algorithm for computing isogenies between elliptic curves
Author :
Yin, Huang ; Jianhua, Chen ; Yong, Kang ; Xiande, Fei
Author_Institution :
Sch. of Math. & Stat., Wuhan Univ., Wuhan, China
Abstract :
The SEA algorithm is used widely in computing the order of elliptic curve,and the computation of isogenies between elliptic curves plays an important part in the algorithm. We surveyed algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. Then we introduced a new algorithm that computes an isogeny of degree t. This algorithm is based on continued fraction. The complexity of the proposed algorithm is O(t).
Keywords :
computational complexity; public key cryptography; Schoof-Elkies-Atkin algorithm; computational complexity; continued fraction; elliptic curves; isogenies computing; Elliptic curve cryptography; Elliptic curves; Galois fields; Kernel; Mathematics; Military computing; Polynomials; Sea measurements; Statistical analysis; Testing; Continued Fraction; Elliptic Curve Cryptography; Finite Field; Isogenies; Schoof-Elkies-Atkin Algorithm;
Conference_Titel :
Test and Measurement, 2009. ICTM '09. International Conference on
Conference_Location :
Hong Kong
Print_ISBN :
978-1-4244-4699-5
DOI :
10.1109/ICTM.2009.5412881
