Counting the number of points on elliptic curves over finite fields: strategies and performances-Reference-Cited by-同舟云学术

Counting the number of points on elliptic curves over finite fields: strategies and performances

Published:1995 Issue: Volume: Page:79-94
ISSN:0302-9743
Container-title:Advances in Cryptology — EUROCRYPT ’95
language:
Short-container-title:

Author:

Lercier Reynald,Morain François

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-49264-X_7

Reference46 articles.

1. Aho, A. V., Hopcroft, J. E., and Ullman, J. D.The design and analysis of computer algorithms. Reading. Addison-Wesley, 1974.

2. Atkin, A. O. L. The number of points on an elliptic curve modulo a prime. Draft, 1988.

3. Atkin, A. O. L. The number of points on an elliptic curve modulo a prime (ii). Draft, 1992.

4. Atkin, A. O. L., and Morain, F. Elliptic curves and primality proving. Math. Comp. 61,203 (July 1993), 29–68.

5. Bender, A., and Castagnoli, G. On the implementation of elliptic curve cryptosystems. In Advances in Cryptology (1989), G. Brassard, Ed., vol. 435 of Lecture Notes in Comput. Sci., Springer-Verlag, pp. 186–192. Proc. Crypto’ 89, Santa Barbara, August 20–24.

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

1. Applied-Information Technology in Research of Security Processing Based on IOT Data;Advanced Materials Research;2014-03

2. Bibliography;Wireless Mobile Internet Security;2013-03-25

3. Equations for the modular curve ₁() and models of elliptic curves with torsion points;Mathematics of Computation;2010-04-16

4. Elliptic Curve Cryptography;Handbook of Information and Communication Security;2010

5. Algebraic curves and cryptography;Finite Fields and Their Applications;2005-08