{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:00:06Z","timestamp":1776844806383,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"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":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14518-6_19","type":"book-chapter","created":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T06:45:55Z","timestamp":1278571555000},"page":"219-233","source":"Crossref","is-referenced-by-count":14,"title":["A Subexponential Algorithm for Evaluating Large Degree Isogenies"],"prefix":"10.1007","author":[{"given":"David","family":"Jao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Soukharev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Bisson, G., Sutherland, A.: Computing the endomorphism ring of an ordinary elliptic curve over a finite field. Journal of Number Theory (to appear 2009)"},{"key":"19_CR2","series-title":"London Mathematical Society Lecture Note Series","volume-title":"Elliptic curves in cryptography","author":"I.F. Blake","year":"2000","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic curves in cryptography. London Mathematical Society Lecture Note Series, vol.\u00a0265. Cambridge University Press, Cambridge (2000); Reprint of the 1999 original (1999)"},{"issue":"263","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1090\/S0025-5718-08-02066-8","volume":"77","author":"A. Bostan","year":"2008","unstructured":"Bostan, A., Morain, F., Salvy, B., Schost, \u00c9.: Fast algorithms for computing isogenies between elliptic curves. Math. Comp.\u00a077(263), 1755\u20131778 (2008)","journal-title":"Math. Comp."},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-85538-5_7","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"R. Br\u00f6ker","year":"2008","unstructured":"Br\u00f6ker, R., Charles, D., Lauter, K.: Evaluating large degree isogenies and applications to pairing based cryptography. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 100\u2013112. Springer, Heidelberg (2008)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Br\u00f6ker, R., Lauter, K., Sutherland, A.: Modular polynomials via isogeny volcanoes (2010)","DOI":"10.1090\/S0025-5718-2011-02508-1"},{"key":"19_CR6","series-title":"Algorithms and Computation in Mathematics","volume-title":"Binary quadratic forms","author":"J. Buchmann","year":"2007","unstructured":"Buchmann, J., Vollmer, U.: Binary quadratic forms. Algorithms and Computation in Mathematics, vol.\u00a020. Springer, Berlin (2007); An algorithmic approach"},{"key":"19_CR7","unstructured":"Certicom ECC Challenge, \n                      http:\/\/www.certicom.com\/images\/pdfs\/cert_ecc_challenge.pdf\n                    ."},{"key":"19_CR8","unstructured":"Certicom ECC Curves List, \n                      http:\/\/www.certicom.com\/index.php\/curves-list"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, H., Frey, G., Avanzi, R., Doche, C., Lange, T., Nguyen, K., Vercauteren, F. (eds.): Handbook of elliptic and hyperelliptic curve cryptography. Discrete Mathematics and its Applications. Chapman & Hall\/CRC (2006)","DOI":"10.1201\/9781420034981"},{"key":"19_CR10","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A course in computational algebraic number theory","author":"H. Cohen","year":"1993","unstructured":"Cohen, H.: A course in computational algebraic number theory. Graduate Texts in Mathematics, vol.\u00a0138. Springer, Berlin (1993)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/3-540-58691-1_42","volume-title":"Algorithmic Number Theory","author":"J.-M. Couveignes","year":"1994","unstructured":"Couveignes, J.-M., Morain, F.: Schoof\u2019s algorithm and isogeny cycles. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol.\u00a0877, pp. 43\u201358. Springer, Heidelberg (1994)"},{"key":"19_CR12","volume-title":"Primes of the form x 2\u2009+\u2009ny 2","author":"D.A. Cox","year":"1989","unstructured":"Cox, D.A.: Primes of the form x\n                           2\u2009+\u2009ny\n                           2. A Wiley-Interscience Publication, John Wiley & Sons Inc., New York (1989); Fermat, class field theory and complex multiplication"},{"issue":"267","key":"19_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. Math. Comp.\u00a078(267), 1809\u20131824 (2009)","journal-title":"Math. Comp."},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-45455-1_23","volume-title":"Algorithmic Number Theory","author":"M. Fouquet","year":"2002","unstructured":"Fouquet, M., Morain, F.: Isogeny volcanoes and the SEA algorithm. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 276\u2013291. Springer, Heidelberg (2002)"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. J. Cryptology (to appear 2010)","DOI":"10.1007\/s00145-009-9048-z"},{"key":"19_CR16","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1112\/S1461157000000097","volume":"2","author":"S.D. Galbraith","year":"1999","unstructured":"Galbraith, S.D.: Constructing isogenies between elliptic curves over finite fields. LMS J. Comput. Math.\u00a02, 118\u2013138 (1999) (electronic)","journal-title":"LMS J. Comput. Math."},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-46035-7_3","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"S.D. Galbraith","year":"2002","unstructured":"Galbraith, S.D., Hess, F., Smart, N.P.: Extending the GHS Weil descent attack. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 29\u201344. Springer, Heidelberg (2002)"},{"issue":"4","key":"19_CR18","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1090\/S0894-0347-1989-1002631-0","volume":"2","author":"J. Hafner","year":"1989","unstructured":"Hafner, J., McCurley, K.: A rigorous subexponential algorithm for computation of class groups. J. Amer. Math. Soc.\u00a02(4), 837\u2013850 (1989)","journal-title":"J. Amer. Math. Soc."},{"issue":"191","key":"19_CR19","first-page":"327","volume":"55","author":"K. Hardy","year":"1990","unstructured":"Hardy, K., Muskat, J.B., Williams, K.S.: A deterministic algorithm for solving n\u2009=\u2009fu\n                           2\u2009+\u2009gv\n                           2 in coprime integers u and v. Math. Comp.\u00a055(191), 327\u2013343 (1990)","journal-title":"Math. Comp."},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/11593447_2","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"D. Jao","year":"2005","unstructured":"Jao, D., Miller, S.D., Venkatesan, R.: Do all elliptic curves of the same order have the same difficulty of discrete log? In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 21\u201340. Springer, Heidelberg (2005)"},{"key":"19_CR21","unstructured":"Kohel, D.: Endomorphism rings of elliptic curves over finite fields. PhD thesis, University of California, Berkeley (1996)"},{"key":"19_CR22","unstructured":"MAGMA Computational Algebra System, \n                      http:\/\/magma.maths.usyd.edu.au\/"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/978-3-540-24660-2_28","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"A. Menezes","year":"2004","unstructured":"Menezes, A., Teske, E., Weng, A.: Weak fields for ECC. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 366\u2013386. Springer, Heidelberg (2004)"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/120694.120711","volume-title":"ISSAC 1991: Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation","author":"A. Sch\u00f6nhage","year":"1991","unstructured":"Sch\u00f6nhage, A.: Fast reduction and composition of binary quadratic forms. In: ISSAC 1991: Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, pp. 128\u2013133. ACM, New York (1991)"},{"issue":"1","key":"19_CR25","doi-asserted-by":"crossref","first-page":"219","DOI":"10.5802\/jtnb.142","volume":"7","author":"R. Schoof","year":"1995","unstructured":"Schoof, R.: Counting points on elliptic curves over finite fields. J. Th\u00e9or. Nombres Bordeaux\u00a07(1), 219\u2013254 (1995); Les Dix-huiti\u00e8mes Journ\u00e9es Arithm\u00e9tiques (Bordeaux, 1993)","journal-title":"J. Th\u00e9or. Nombres Bordeaux"},{"issue":"178","key":"19_CR26","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1090\/S0025-5718-1987-0878705-X","volume":"48","author":"M. Seysen","year":"1987","unstructured":"Seysen, M.: A probabilistic factorization algorithm with quadratic forms of negative discriminant. Math. Comp.\u00a048(178), 757\u2013780 (1987)","journal-title":"Math. Comp."},{"key":"19_CR27","series-title":"Graduate Texts in Mathematics","volume-title":"The arithmetic of elliptic curves","author":"J. Silverman","year":"1992","unstructured":"Silverman, J.: The arithmetic of elliptic curves. Graduate Texts in Mathematics, vol.\u00a0106. Springer, New York (1992); Corrected reprint of the 1986 original (1986)"},{"key":"19_CR28","unstructured":"Sutherland, A.:Smoothrelation, \n                      http:\/\/math.mit.edu\/~drew\/smoothrelation_v1.tar"},{"key":"19_CR29","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BF01404549","volume":"2","author":"J. Tate","year":"1966","unstructured":"Tate, J.: Endomorphisms of abelian varieties over finite fields. Invent. Math.\u00a02, 134\u2013144 (1966)","journal-title":"Invent. Math."},{"issue":"1","key":"19_CR30","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00145-004-0328-3","volume":"19","author":"E. Teske","year":"2006","unstructured":"Teske, E.: An elliptic curve trapdoor system. J. Cryptology\u00a019(1), 115\u2013133 (2006)","journal-title":"J. Cryptology"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T22:07:18Z","timestamp":1676066838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14518-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145179","9783642145186"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14518-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}