Counting the number of points on elliptic curves over finite fields of characteristic greater than three-Reference-Cited by-同舟云学术

Counting the number of points on elliptic curves over finite fields of characteristic greater than three

Published:1994 Issue: Volume: Page:60-70
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Lehmann Frank,Maurer Markus,Müller Volker,Shoup Victor

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58691-1_44.pdf

Reference12 articles.

1. A.O.L. Atkin: The number of points on an elliptic curve modulo a prime, unpublished manuscript

2. J. Buchmann, V. Müller: Computing the number of points on an elliptic curve over finite fields, Proceedings of ISSAC 1991, 179–182

3. J. M. Couveignes, F. Morain: Schoof's algorithm and isogeny cycles, Proceedings of ANTS 1994

4. N. Koblitz: Elliptic curve cryptosystems, Mathematics of Computation, 48 (1987), 203–209

5. V. Miller: Uses of elliptic curves in cryptography, Advances in Cryptology: Proceedings of Crypto '85, Lecture Notes in Computer Science, 218 (1986), Springer-Verlag, 417–426

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

1. An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24

2. An Improved Baby Step Giant Step Algorithm for Point Counting of Hyperelliptic Curves over Finite Fields;Lecture Notes in Computer Science;2002

3. Finding the Eigenvalue in Elkies' Algorithm;Experimental Mathematics;2001-01

4. Cryptography;Mathematics Unlimited — 2001 and Beyond;2001

5. A Survey of Number Theory and Cryptography;Number Theory;2000