Choosing the correct elliptic curve in the CM method

Mathematics of Computation

Volumn 79, Issue 269, 2010, Pages 545-561

  Rubin, K ^a   Silverberg, A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

CM method; Elliptic curves; Point counting

Indexed keywords

EID: 77950188914     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-09-02266-2     Document Type: Article

References (35)

1. A.O.L. Atkin, F. Morain, Elliptic curves and primality proving, Math. Comp.61 (1993), 29-68.
2. J. Belding, R. Bröker, A. Enge, K. Lauter, Computing Hilbert class polynomials,in Algorithmic number theory - ANTS-VIII, Lecture Notes in Comput. Sci. 5011, Springer, Berlin, 2008, 282-295.
3. B.J.Birch, Weber's class invariants, Mathematika 16 (1969), 283-294.
4. I. Blake, G. Seroussi, N. Smart, Elliptic Curves in Cryptography, London Math. Society Lecture Note Series 265, Cambridge University Press, Cambridge, 1999.
5. R. Bröker, A p-adic algorithm to compute the Hilbert class polynomial, Math. Comp.77 (2008), 2417-2435.
6. H. Cohen, A course in computational algebraic number theory, Graduate Texts in Mathematics 138, Springer, New York, 1993.
7. 2, John Wiley & Sons, New York, 1989.
8. A. Enge, The complexity of class polynomial computation via floating point approximations, Math. Comp.78 (2009), 1089-1107.
9. A. Enge, Computing modular polynomials in quasi-linear time, Math. Comp.78 (2009), 1809-1824.
10. A. Enge, F. Morain, Comparing invariants for class fields of imaginary quadratric fields,in Algorithmic Number Theory (Sydney, 2002), Lect. Notes in Comput. Sci. 2369, Springer, Berlin, 2002, 252-266.
11. S. Galbraith, Pairings, Chapter IX of Advances in Elliptic Curve Cryptography, I. F. Blake, G. Seroussi, N. P. Smart, eds., London Math. Society Lecture Note Series 317, Cambridge University Press, Cambridge, 2005, 183-213.
12. A. Gee, Class invariants by Shimura's reciprocity law,in Les XXémes Journées Arithmétiques (Limoges, 1997), J. Théor. Nombres Bordeaux 11 (1999), 45-72.
13. A. Gee, P. Stevenhagen, Generating class fields using Shimura reciprocity, in Algorithmic Number Theory (Portland, OR, 1998), Lect. Notes in Comput. Sci. 1423, Springer, Berlin, 1998, 441-453.
14. B. H. Gross, Arithmetic on elliptic curves with complex multiplication, Lect. Notes in Math. 776, Springer, Berlin, 1980.
15. B. H. Gross, Minimal models for elliptic curves with complex multiplication, Compositio Math. 45 (1982), 155-164.
16. B. H. Gross, D. B. Zagier, On singular moduli,J. Reine Angew. Math.355 (1985), 191-220.
17. IEEE 1363-2000: Standard Specifications For Public Key Cryptography, Annex A. Number-Theoretic Background, http://grouper.ieee.org/groups/1363/private/P1363A-11-12-99.pdf
18. K. Ireland, M. Rosen, A classical introduction to modern number theory, Second Edition, Grad. Texts in Math. 84, Springer, New York, 1990.
19. N. Ishii, Trace of Frobenius endomorphism of an elliptic curve with complex multiplication, Bull. Austral. Math. Soc. 70 (2004), 125-142.
20. F. Morain, Primality proving using elliptic curves: An update, in Algorithmic Number Theory (Portland, OR, 1998), Lect. Notes in Comput. Sci. 1423, Springer, Berlin, 1998, 111-127.
21. F. Morain, Computing the cardinality of CM elliptic curves using torsion points,J.Théor. Nombres Bordeaux 19 (2007), 663-681.
22. Y. Nogami, Y. Morikawa, A Method for Distinguishing the Two Candidate Elliptic Curves in CM Method, in Information Security and Cryptology - ICISC 2004, Lect. Notes in Comput. Sci. 3506, Springer, Berlin, 2005, 249-260.
23. Y. Nogami, M. Obara, Y. Morikawa, A Method for Distinguishing the Two Candidate Elliptic Curves in the Complex Multiplication Method, ETRI Journal 28 (2006) 745-760.
24. PARI/GP, version 2.4.0 (alpha), Bordeaux (2005), http://pari.math.u-bordeaux.fr
25. A. R. Rajwade, J. C. Parnami, A new cubic character sum, Acta Arith. 40 (1981/82), 347-356.
26. K. Rubin, A. Silverberg, Point counting on reductions of CM elliptic curves,to appear in J. Number Theory (2009).
27. K. Rubin, A. Silverberg, http://math.uci.edu/~asilverb/bibliography/CMmethod.html
28. R. S. Rumely, A formula for the grössencharacter of a parametrized elliptic curve,J. Number Theory 17 (1983), 389-402.
29. R. Schertz, Die singulären Werte der Weberschen Funktionen f, f1, f2,γ2,γ3,J. Reine Angew. Math. 286/287 (1976), 46-74.
30. R. Schertz, Weber's class invariants revisited,J.Théor. Nombres Bordeaux 14 (2002), 325-343.
31. M. Scott, A C++ Implementation of the Complex Multiplication (CM) Elliptic Curve Generation Algorithm from Annex A, in Implementations of portions of the IEEE P1363 draft, http://grouper.ieee.org/groups/1363/P1363/implementations.html
32. G. Shimura, Introduction to the arithmetic theory of automorphic functions, Reprint of the 1971 original, Publications of the Mathematical Society of Japan 11, Princeton University Press, Princeton, NJ, 1994.
33. J. Silverman, Advanced topics in the arithmetic of elliptic curves, Graduate Texts in Mathematics 151, Springer, New York, 1994.
34. H. M. Stark, Counting points on CM elliptic curves, Rocky Mountain J. Math. 26 (1996), 1115-1138.
35. H. Weber, Lehrbuch der Algebra, Braunschweig, 1908 (reprinted by Chelsea Publ. Co., New York, Third Reprinted Edition, 1979).