{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:59Z","timestamp":1772283659732,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642145179","type":"print"},{"value":"9783642145186","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14518-6_14","type":"book-chapter","created":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T06:45:55Z","timestamp":1278571555000},"page":"142-156","source":"Crossref","is-referenced-by-count":22,"title":["Class Invariants by the CRT Method"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Enge","sequence":"first","affiliation":[]},{"given":"Andrew V.","family":"Sutherland","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"191","key":"14_CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1090\/S0025-5718-1990-1023756-8","volume":"55","author":"E. Bach","year":"1990","unstructured":"Bach, E.: Explicit bounds for primality testing and related problems. Mathematics of Computation\u00a055(191), 355\u2013380 (1990)","journal-title":"Mathematics of Computation"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-79456-1_19","volume-title":"Algorithmic Number Theory","author":"J. Belding","year":"2008","unstructured":"Belding, J., Br\u00f6ker, R., Enge, A., Lauter, K.: Computing Hilbert class polynomials. In: van der Poorten, A.J., Stein, A. (eds.) ANTS-VIII 2008. LNCS, vol.\u00a05011, pp. 282\u2013295. Springer, Heidelberg (2008)"},{"issue":"4","key":"14_CR3","doi-asserted-by":"crossref","first-page":"427","DOI":"10.4153\/CMB-1999-050-1","volume":"42","author":"B.C. Berndt","year":"1999","unstructured":"Berndt, B.C., Chan, H.H.: Ramanujan and the modular j-invariant. Canadian Mathematical Bulletin\u00a042(4), 427\u2013440 (1999)","journal-title":"Canadian Mathematical Bulletin"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1090\/S0025-5718-06-01849-7","volume":"76","author":"D.J. Bernstein","year":"2007","unstructured":"Bernstein, D.J.: Modular exponentiation via the explicit Chinese Remainder Theorem. Mathematics of Computation\u00a076, 443\u2013454 (2007)","journal-title":"Mathematics of Computation"},{"key":"14_CR5","unstructured":"Bisson, G., Sutherland, A.V.: Computing the endomorphism ring of an ordinary elliptic curve over a finite field. Journal of Number Theory (2009) (to appear), \n                      http:\/\/arxiv.org\/abs\/0902.4670"},{"key":"14_CR6","volume-title":"Constructing elliptic curves of prescribed order","author":"R. Br\u00f6ker","year":"2006","unstructured":"Br\u00f6ker, R.: Constructing elliptic curves of prescribed order. Universiteit Leiden, Proefschrift (2006)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"2417","DOI":"10.1090\/S0025-5718-08-02091-7","volume":"77","author":"R. Br\u00f6ker","year":"2008","unstructured":"Br\u00f6ker, R.: A p-adic algorithm to compute the Hilbert class polynomial. Mathematics of Computation\u00a077, 2417\u20132435 (2008)","journal-title":"Mathematics of Computation"},{"key":"14_CR8","unstructured":"Br\u00f6ker, R., Lauter, K., Sutherland, A.V.: Modular polynomials via isogeny volcanoes (2009) (preprint), \n                      http:\/\/arxiv.org\/abs\/1001.0402"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-45455-1_19","volume-title":"Algorithmic Number Theory","author":"J.-M. Couveignes","year":"2002","unstructured":"Couveignes, J.-M., Henocq, T.: Action of modular correspondences around CM points. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 234\u2013243. Springer, Heidelberg (2002)"},{"key":"14_CR10","first-page":"21","volume-title":"Computational Perspectives on Number Theory","author":"N.D. Elkies","year":"1998","unstructured":"Elkies, N.D.: Elliptic and modular curves over finite fields and related computational issues. In: Buell, D.A., Teitelbaum, J.T. (eds.) Computational Perspectives on Number Theory, pp. 21\u201376. AMS, Providence (1998)"},{"key":"14_CR11","volume-title":"Habilitation \u00e0 diriger des recherches","author":"A. Enge","year":"2007","unstructured":"Enge, A.: Courbes alg\u00e9briques et cryptologie. In: Habilitation \u00e0 diriger des recherches, vol.\u00a07. Universit\u00e9 Denis Diderot, Paris (2007)"},{"issue":"266","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1090\/S0025-5718-08-02200-X","volume":"78","author":"A. Enge","year":"2009","unstructured":"Enge, A.: The complexity of class polynomial computation via floating point approximations. Mathematics of Computation\u00a078(266), 1089\u20131107 (2009)","journal-title":"Mathematics of Computation"},{"issue":"267","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1090\/S0025-5718-09-02199-1","volume":"78","author":"A. Enge","year":"2009","unstructured":"Enge, A.: Computing modular polynomials in quasi-linear time. Mathematics of Computation\u00a078(267), 1809\u20131824 (2009)","journal-title":"Mathematics of Computation"},{"key":"14_CR14","unstructured":"Enge, A.: cm, 0.2 edition (2010), \n                      http:\/\/cm.multiprecision.org\/"},{"key":"14_CR15","unstructured":"Enge, A., Morain, F.: Generalised Weber functions. I. Technical Report 385608, HAL-INRIA (2009), \n                      http:\/\/hal.inria.fr\/inria-00385608"},{"key":"14_CR16","doi-asserted-by":"crossref","first-page":"555","DOI":"10.5802\/jtnb.460","volume":"16","author":"A. Enge","year":"2004","unstructured":"Enge, A., Schertz, R.: Constructing elliptic curves over finite fields using double eta-quotients. Journal de Th\u00e9orie des Nombres de Bordeaux\u00a016, 555\u2013568 (2004)","journal-title":"Journal de Th\u00e9orie des Nombres de Bordeaux"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"129","DOI":"10.4064\/aa118-2-3","volume":"118","author":"A. Enge","year":"2005","unstructured":"Enge, A., Schertz, R.: Modular curves of composite level. Acta Arithmetica\u00a0118(2), 129\u2013141 (2005)","journal-title":"Acta Arithmetica"},{"key":"14_CR18","unstructured":"Enge, A., Schertz, R.: Singular values of multiple eta-quotients for ramified primes (in preparation 2010)"},{"key":"14_CR19","unstructured":"Free\u00a0Software Foundation. GNU Compiler Collection, 4.2.4 edition (2008), \n                      http:\/\/gcc.gnu.org\/"},{"key":"14_CR20","volume-title":"Class fields by Shimura reciprocity","author":"A. Gee","year":"2001","unstructured":"Gee, A.: Class fields by Shimura reciprocity. Universiteit Leiden, Proefschrift (2001)"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/BFb0054883","volume-title":"Algorithmic Number Theory","author":"A. Gee","year":"1998","unstructured":"Gee, A., Stevenhagen, P.: Generating class fields using Shimura reciprocity. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 441\u2013453. Springer, Heidelberg (1998)"},{"key":"14_CR22","unstructured":"Granlund, T., et al.: gmp, 4.3.1 edition (2009). \n                      http:\/\/gmplib.org\/\n                    ."},{"issue":"3","key":"14_CR23","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1215\/S0012-7094-97-09013-X","volume":"90","author":"F. Hajir","year":"1997","unstructured":"Hajir, F., Villegas, F.R.: Explicit elliptic units, I. Duke Mathematical Journal\u00a090(3), 495\u2013521 (1997)","journal-title":"Duke Mathematical Journal"},{"key":"14_CR24","unstructured":"Harvey, D.: $\\text{zn\\_poly}$: a library for polynomial arithmetic, 0.9 edn. (2008), \n                      http:\/\/cims.nyu.edu\/~harvey\/zn_poly"},{"key":"14_CR25","unstructured":"Kohel, D.: Endomorphism rings of elliptic curves over finite fields. PhD thesis, University of California at Berkeley (1996)"},{"issue":"1","key":"14_CR26","doi-asserted-by":"crossref","first-page":"111","DOI":"10.5802\/jtnb.143","volume":"7","author":"F. Morain","year":"1995","unstructured":"Morain, F.: Calcul du nombre de points sur une courbe elliptique dans un corps fini: aspects algorithmiques. Journal de Th\u00e9orie des Nombres de Bordeaux\u00a07(1), 111\u2013138 (1995)","journal-title":"Journal de Th\u00e9orie des Nombres de Bordeaux"},{"key":"14_CR27","unstructured":"Morain, F.: Advances in the CM method for elliptic curves. In: Slides of Fields Cryptography Retrospective Meeting, May 11-15 (2009), \n                      http:\/\/www.lix.polytechnique.fr\/~morain\/Exposes\/fields09.pdf"},{"issue":"1","key":"14_CR28","doi-asserted-by":"crossref","first-page":"325","DOI":"10.5802\/jtnb.361","volume":"14","author":"R. Schertz","year":"2002","unstructured":"Schertz, R.: Weber\u2019s class invariants revisited. Journal de Th\u00e9orie des Nombres de Bordeaux\u00a014(1), 325\u2013343 (2002)","journal-title":"Journal de Th\u00e9orie des Nombres de Bordeaux"},{"key":"14_CR29","unstructured":"Shoup, V.: NTL: A library for doing number theory, 5.5 edn. (2008), \n                      http:\/\/www.shoup.net\/ntl\/"},{"key":"14_CR30","unstructured":"Sutherland, A.V.: Computing Hilbert class polynomials with the Chinese Remainder Theorem. Mathematics of Computation (to appear 2010), \n                      http:\/\/arxiv.org\/abs\/0903.2785"},{"key":"14_CR31","unstructured":"Weber, H.: Lehrbuch der Algebra, 3rd edn., vol.\u00a0III. Chelsea, New York (1961)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14518-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T03:24:55Z","timestamp":1676690695000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14518-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145179","9783642145186"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14518-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}