Fast Elliptic Curve Point Counting Using Gaussian Normal Basis-Reference-Cited by-同舟云学术

Fast Elliptic Curve Point Counting Using Gaussian Normal Basis

Published:2002 Issue: Volume: Page:292-307
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Kim Hae Young,Park Jung Youl,Cheon Jung Hee,Park Je Hong,Kim Jae Heon,Hahn Sang Geun

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45455-1_24

Reference24 articles.

1. A. O. L. Atkin, The number of points on an elliptic curve modulo a prime, Series of e-mails to the NUMBERTHRY mailing list, 1992.

2. L. F. Blake, R. M. Roth, and G. Seroussi, Efficient Arithmetic in GF(2n) through Palindromic Representation, Tech. Rep. HPL-98-134, Hewlett Packard, 1998.

3. I. Blake, G. Seroussi, and N. Smart, Elliptic Curves in Cryptography, Cambridge Univ. Press, 2000.

4. Lect Notes Comput Sci;J. M. Couveignes,1996

5. M. Deuring, Die Typen der Multiplikatorenringe elliptischer Funktionenkörper. Abh. Math. Sem. Univ. Hamburg, 14, pp. 197–272, 1941.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Generalized MSST Algorithm for Counting Points of Elliptic Curves over $$\mathbb{F}_{p^{n}}$$;Journal of Systems Science and Complexity;2024-06-11

2. Point Counting in Families of Hyperelliptic Curves in Characteristic 2;LMS Journal of Computation and Mathematics;2007

3. A quasi quadratic time algorithm for hyperelliptic curve point counting;The Ramanujan Journal;2006-12

4. Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time;Lecture Notes in Computer Science;2003

5. On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields;Lecture Notes in Computer Science;2002