Efficient implementation of schoof’s algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1514, Issue , 1998, Pages 66-79

  Izu, Tetsuya ^a   Kogure, Jun ^a   Noro, Masayuki ^a   Yokoyama, Kazuhiro ^a  

^a FUJITSU LABORATORIES LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; SECURITY OF DATA;

EFFICIENT IMPLEMENTATION; ELLIPTIC CURVE; FINITE FIELDS; RATIONAL POINTS; S-ALGORITHMS;

CRYPTOGRAPHY;

EID: 84947711740     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49649-1_7     Document Type: Conference Paper

References (26)

1. Atkin, A.O., The number of points on an elliptic curve modulo a prime, preprint, 1988.
2. Atkin, A.O., Morain, F., Elliptic curves and primality proving, Math. Comp. 61 (1993) 29-68.
3. Chao, J., Tanada, K., Tsujii, S., Design of elliptic curves with controllable lower boundary of extension degree for reduction attacks, in CRYPTO '94, Y.Desmedt, Ed, Lecture Notes in Computer Science, 839, pp.50-55, 1994.
4. Charlap, L.S., Coley, R., Robbins, D.P., Enumeration of rational points on elliptic curves over finite fields, preprint, 1991.
5. Couveignes, J.-M., Dewaghe, L., Morain, F., Isogeny cycles and the Schoof-Elkies-Atkin algorithm, LIX/RR/96/03, 1996.
6. Couveignes, J.-M., Morain, F., Schoof's algorithm and isogeny cycles, in ANTI, L.Adleman and M.-D.Huang, Eds, Lecture Notes in Computer Science, 877, pp.43-58, 1994.
7. Elkies, N.D., Explicit isogenies, preprint, 1991.
8. Izu, T., Noro, M. Fast remainder calculation in polynomial multiplication, in preparation.
9. Kobilitz N. Elliptic curve cryptosystems, Math, Comp. 48 (1987) 203-209.
10. Lay, G.J., Zimmer, H.G., Constructing elliptic curves with given group order over large finite fields, in ANT-I, L.Adleman and M.-D.Huang, Eds, Lecture Notes inComputer Science, 877, pp.250-263, 1994.
11. Lenstra, H.W., Factoring integers with elliptic curves, Annals of Mathematics 126 (1987) 649-673.
12. Lercier, R., Algorithmique des courbes elliptiques dans les corps finis, Doctoral Thesis, L'Ecole Polytechnique, 1997.
13. Lercier, R., Finding good random elliptic curves for cryptosystems defined over, in EURO-CRYPT '97, W.Fumy, Ed, Lecture Notes in Computer Science, 1233, pp. 379-392, 1997.
14. Lercier, R., Morain, F., Counting the number of points on elliptic curves over finite fields: strategy and performances, in EURO-CRYPT '95, L.C.Guillou and J.-J.Quisquater, Eds, Lecture Notes in Computer Science, 921, pp.79-94, 1995.
15. Menezes, A, Elliptic curve public key cryptosystems, Kluwer Academic Publishers, Boston, 1993.
16. Menezes, A., Okamoto, T., Vanstone, S.E., Reducing elliptic curves logarithms to logarithms in a finite field, in STOC '91, ACM Press, New York, pp.80-89, 1991.
17. Miller, V.S., Uses of elliptic curves in cryptography, in CRYPTO '85, Lecture Notesin Computer Science, 218, pp.417-426, 1986.
18. Miyaji, A., Elliptic curves over Fp suitable for cryptosystems, in AUSCRYPT '92, J.Seberry and Y.Zhengs, Eds, Lecture Notes in Computer Science, 718, pp. 479-491, 1992.
19. Morain, F, Calcul du nombre de points sur une courbe elliptique dans un corps fini: aspects algorithmiques, J. Theor. Nombres Bordeaux 7 (1995) 255-282. Risa/Asir, (ftp://endeavor.fujitsu.co.jp/pub/isis/asir).
20. Satoh, T., Araki, K., Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves, Commentarii Mathematici Universitatis SanctiPauli 47 (1998) 81-92.
21. Schoof, R. Elliptic curves over finite fields and the computation of square roots mod p, Math. Comp. 44 (1985) 483-494.
22. Schoof, R., Counting points on elliptic curves over finite fields, J. Theor. Nombres Bordeaux 7 (1995) 219-254.
23. Shoup, V., A new polynomial factorization algorithm and its implementation, J. Symbolic Computation. 20 (1995) 364-397.
24. Silverman, J.H, The arithmetic of elliptic curves, Graduate Texts in Mathematics 106, Springer-Verlag, 1986.
25. Silverman, J.H, Advanced topics in the arithmetic of elliptic curves, Graduate Texts in Mathematics 151, Springer-Verlag, 1994.
26. Smart, N.P. The discrete logarithm problem on elliptic curves of trace one, preprint, 1997.