Skip to main content Accessibility help
×
×
Home

p-adic class invariants

  • Reinier Bröker (a1)

Abstract

We develop a new p-adic algorithm to compute the minimal polynomial of a class invariant. Our approach works for virtually any modular function yielding class invariants. The main algorithmic tool is modular polynomials, a concept which we generalize to functions of higher level.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      p-adic class invariants
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      p-adic class invariants
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      p-adic class invariants
      Available formats
      ×

Copyright

References

Hide All
[1]Agashe, A., Lauter, K. and Venkatesan, R., ‘Constructing elliptic curves with a known number of points over a prime field’, High primes and misdemeanours: lectures in honour of the 60th birthday of H. C. Williams, Fields Institute Communications Series 41 (American Mathematical Society, Providence, RI, 2004) 1–17.
[2]Belding, J., Bröker, R., Enge, A. and Lauter, K., ‘Computing Hilbert class polynomials’, Algorithmic number theory symposium VIII, Lecture Notes in Computer Science 5011 (Springer, Berlin, 2008).
[3]Bröker, R., ‘Constructing elliptic curves of prescribed order’, PhD Thesis, Universiteit Leiden, 2006.
[4]Bröker, R, ‘A p-adic algorithm to compute the Hilbert class polynomial’, Math. Comp. 77 (2008) 24172435.
[5]Bröker, R. and Stevenhagen, P., ‘Constructing elliptic curves of prime order’, Contemp. Math. 463 (2008) 1728.
[6]Cohen, H., Frey, G.et al., Handbook of elliptic and hyperelliptic curve cryptography (Chapman & Hall, 2006).
[7]Couveignes, J.-M. and Henocq, T., ‘Action of modular correspondences around CM-points’, Algorithmic number theory symposium V, Lecture Notes in Computer Science 2369 (Springer, Berlin, 2002) 234243.
[8]Enge, A., ‘The complexity of class polynomial computation via floating point approximations’, Math. Comp. 78 (2009) 10891107.
[9]Enge, A. and Morain, F., ‘Comparing invariants for class fields of imaginary quadratic fields’, Algorithmic number theory symposium V, Lecture Notes in Computer Science 2369 (Springer, Berlin, 2002) 252266.
[10]Enge, A. and Schertz, R., ‘Constructing elliptic curves over finite fields using double eta-quotients’, J. Théor. Nombres Bordeaux 16 (2004) 555568.
[11]Enge, A. and Schertz, R., ‘Modular curves of composite level’, Acta Arith. 118 (2005) 129141.
[12]Franke, J., Kleinjung, T., Morain, F. and Wirth, T., ‘Proving the primality of very large numbers with fast ECPP’, Algorithmic number theory symposium VI, Lecture Notes in Computer Science 3076 (Springer, Berlin, 2004) 194207.
[13]Gee, A. and Stevenhagen, P., ‘Generating class fields using Shimura reciprocity’, Algorithmic number theory, Lecture Notes in Computer Science 1423 (Springer, Berlin, 1998) 441453.
[14]Hindry, M. and Silverman, J. H., Diophantine geometry, an introduction, Graduate Texts in Mathematics 201 (Springer, Berlin, 2000).
[15]de Jong, A. J., ‘Families of curves and alterations’, Ann. Inst. Fourier (Grenoble) 47 (1997) 599621.
[16]Kohel, D., ‘Endomorphism rings of elliptic curves over finite fields’, PhD Thesis, University of California, Berkeley, 1996.
[17]Lang, S., Elliptic functions, Graduate Texts in Mathematics 112 (Springer, Berlin, 1987).
[18]Neukirch, J., Algebraic number theory, Grundlehren der Mathematischen Wissenschaften 322 (Springer, Berlin, 1999).
[19]Schoof, R., ‘Counting points on elliptic curves over finite fields’, J. Théor. Nombres Bordeaux 7 (1993) 219254.
[20]Shimura, G., Introduction to the arithmetic theory of automorphic forms (Princeton University Press, Princeton, NJ, 1971).
[21]Stevenhagen, P., ‘Hilbert’s 12th problem, complex multiplication and Shimura reciprocity’, Class field theory—its centenary and prospect, Advanced Studies in Pure Mathematics 30 (ed. K. Miyake; Mathematical Society of Japan, Tokyo, 2001) 161–176.
[22]Sutherland, A. V., ‘Computing Hilbert class polynomials with the Chinese remainder theorem’ Math. Comp., to appear, available at http://arxiv.org/abs/0903.2785.
[23]Vélu, J., ‘Isogénies entre courbes elliptiques’, C. R. Acad. Sci. Paris Sér. A–B 273 (1971) A238A241.
[24]Weber, H., Lehrbuch der Algebra (Friedrich Vieweg und Sohn, 1908).
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

LMS Journal of Computation and Mathematics
  • ISSN: -
  • EISSN: 1461-1570
  • URL: /core/journals/lms-journal-of-computation-and-mathematics
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed