{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T08:01:07Z","timestamp":1790496067120,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540855033","type":"print"},{"value":"9783540855385","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85538-5_7","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T00:12:35Z","timestamp":1219623155000},"page":"100-112","source":"Crossref","is-referenced-by-count":16,"title":["Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography"],"prefix":"10.1007","author":[{"given":"Reinier","family":"Br\u00f6ker","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Denis","family":"Charles","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kristin","family":"Lauter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"key":"7_CR2","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, E.: Fast algorithms for computing isogenies between elliptic curves. Math. Comp.\u00a077, 1755\u20131778 (2008)","journal-title":"Math. Comp."},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1090\/conm\/463\/09043","volume":"463","author":"R. Br\u00f6ker","year":"2008","unstructured":"Br\u00f6ker, R., Stevenhagen, P.: Constructing elliptic curves of prime order. Contemp. Math.\u00a0463, 17\u201328 (2008)","journal-title":"Contemp. Math."},{"key":"7_CR4","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":"Henri Cohen","year":"1993","unstructured":"Cohen, H.: A course in computational algebraic number theory. Springer Graduate Texts in Mathematics, vol.\u00a0138 (1993)"},{"key":"7_CR5","unstructured":"Jao, D., Venkatesan, R.: Use of isogenies for design of cryptosystems, http:\/\/www.freepatentsonline.com\/EP1528705.html"},{"key":"7_CR6","unstructured":"Kohel, D.: Endomorphism Rings of Elliptic Curves over Finite Fields, PhD thesis, University of California at Berkeley (1996)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/978-3-540-24582-7_23","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"E. Konstantinou","year":"2003","unstructured":"Konstantinou, E., Stamatiou, Y.C., Zaroliagis, C.D.: On the construction of prime order elliptic curves. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol.\u00a02904, pp. 309\u2013322. Springer, Heidelberg (2003)"},{"key":"7_CR8","first-page":"5","volume-title":"Graduate Texts in Mathematics","author":"Serge Lang","year":"1987","unstructured":"Lang, S.: Elliptic functions, 2nd edn. Springer Graduate Texts in Mathematics, vol.\u00a0112 (1987)"},{"issue":"5","key":"7_CR9","first-page":"1234","volume":"E84-A","author":"A. Miyaji","year":"2001","unstructured":"Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. on Fund.\u00a0E84-A(5), 1234\u20131243 (2001)","journal-title":"IEICE Trans. on Fund."},{"key":"7_CR10","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, 219\u2013254 (1995)","journal-title":"J. Th\u00e9or. Nombres Bordeaux"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Silverman, J.: Advanced topics in the arithmetic of elliptic curves. Springer Graduate Texts in Mathematics, vol.\u00a0151 (1994)","DOI":"10.1007\/978-1-4612-0851-8"},{"key":"7_CR12","unstructured":"Silverman, J.: The arithmetics of elliptic curves, 2nd edn. Springer Graduate Texts in Mathematics, vol.\u00a0106 (1992)"},{"key":"7_CR13","first-page":"238","volume":"273","author":"J. V\u00e9lu","year":"1971","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. C. R. Acad. Sci. Paris S\u00e9r. A\u2013B\u00a0273, A238\u2013A241 (1971)","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. A\u2013B"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography \u2013 Pairing 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85538-5_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:32:06Z","timestamp":1606167126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85538-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540855033","9783540855385"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85538-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}