{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:18:55Z","timestamp":1648585135044},"reference-count":15,"publisher":"Wiley","license":[{"start":{"date-parts":[[2010,2,1]],"date-time":"2010-02-01T00:00:00Z","timestamp":1264982400000},"content-version":"unspecified","delay-in-days":1857,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["LMS J. Comput. Math."],"published-print":{"date-parts":[[2005]]},"abstract":"Abstract<\/jats:title>This paper presents a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves, and are useful in many aspects of computational number theory and cryptography. The algorithm presented here has the distinguishing feature that it does not involve the computation of Fourier coefficients of modular forms. The need to compute the exponentially large integral coefficients is avoided by working directly modulo a prime, and computing isogenies between elliptic curves via V\u00e9lu's formulas.<\/jats:p>","DOI":"10.1112\/s1461157000000954","type":"journal-article","created":{"date-parts":[[2013,8,6]],"date-time":"2013-08-06T11:42:44Z","timestamp":1375789364000},"page":"195-204","source":"Crossref","is-referenced-by-count":4,"title":["Computing Modular Polynomials"],"prefix":"10.1112","volume":"8","author":[{"given":"Denis","family":"Charles","sequence":"first","affiliation":[]},{"given":"Kristin","family":"Lauter","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2010,2,1]]},"reference":[{"key":"S1461157000000954_ref015","first-page":"238","article-title":"\u2018Isog\u00e9nies entre courbes elliptiques\u2019","volume":"273","author":"V\u00e9lu","year":"1971","journal-title":"C. R. Acad. Sci. Paris"},{"key":"S1461157000000954_ref013","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1994.1025"},{"key":"S1461157000000954_ref012","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(87)90003-3"},{"key":"S1461157000000954_ref008","first-page":"673","article-title":"Algorithms in number theory","author":"Lenstra","year":"1990","journal-title":"Handbook of Theoret. Comput. Sci. A"},{"key":"S1461157000000954_ref007","first-page":"21","volume-title":"Computational perspectives on number theory:","author":"Elkies","year":"1998"},{"key":"S1461157000000954_ref001","first-page":"1","article-title":"\u2018Constructing elliptic curves with a known number of points over a prime field\u2019","volume":"42","author":"Agashe","year":"2003","journal-title":"Fields Inst. Commun."},{"key":"S1461157000000954_ref011","doi-asserted-by":"publisher","DOI":"10.1007\/BF02547776"},{"key":"S1461157000000954_ref005","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49649-1_9"},{"key":"S1461157000000954_ref006","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100061697"},{"key":"S1461157000000954_ref014","article-title":"The arithmetic of elliptic curves","volume":"106","author":"Silverman","year":"1986","journal-title":"Grad. Texts in Math."},{"key":"S1461157000000954_ref010","first-page":"217","article-title":"\u2018La m\u00e9thode des graphes. Exemples et applications\u2019","author":"Mestre","year":"1986","journal-title":"Nagoya Univ., Nagoya"},{"key":"S1461157000000954_ref009","doi-asserted-by":"publisher","DOI":"10.1017\/S0004972700040831"},{"key":"S1461157000000954_ref003","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107360211"},{"key":"S1461157000000954_ref002","doi-asserted-by":"publisher","DOI":"10.2307\/1969420"},{"key":"S1461157000000954_ref004","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-12.1.179"}],"container-title":["LMS Journal of Computation and Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1461157000000954","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T02:28:35Z","timestamp":1559874515000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1461157000000954\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":15,"alternative-id":["S1461157000000954"],"URL":"https:\/\/doi.org\/10.1112\/s1461157000000954","relation":{},"ISSN":["1461-1570"],"issn-type":[{"value":"1461-1570","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}