{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:33:20Z","timestamp":1743096800845,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319230207"},{"type":"electronic","value":"9783319230214"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23021-4_13","type":"book-chapter","created":{"date-parts":[[2015,9,8]],"date-time":"2015-09-08T20:47:30Z","timestamp":1441745250000},"page":"140-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Near Prime-Order Elliptic Curves with Small Embedding Degrees"],"prefix":"10.1007","author":[{"given":"Duc-Phong","family":"Le","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"El Mrabet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chik How","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,9]]},"reference":[{"issue":"5","key":"13_CR1","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.jnt.2010.05.013","volume":"131","author":"C Ar\u00e8ne","year":"2011","unstructured":"Ar\u00e8ne, C., Lange, T., Naehrig, M., Ritzenthaler, C.: Faster computation of the Tate pairing. Journal of Number Theory 131(5), 842\u2013857 (2011)","journal-title":"Journal of Number Theory"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Balasubramanian, R., Koblitz, N.: The improbability that an elliptic curve has subexponential discrete log problem under the menezes - okamoto - vanstone algorithm. J. Cryptology, 141\u2013145 (1998)","DOI":"10.1007\/s001459900040"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-68164-9_26","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted edwards curves. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 389\u2013405. Springer, Heidelberg (2008)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-76900-2_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"DJ Bernstein","year":"2007","unstructured":"Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 29\u201350. Springer, Heidelberg (2007)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-Based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-40663-8_15","volume-title":"Algebraic Informatics","author":"G Fotiadis","year":"2013","unstructured":"Fotiadis, G., Konstantinou, E.: On the efficient generation of generalized MNT elliptic curves Santa Barbara, California, USA. In: Muntean, T., Poulakis, D., Rolland, R. (eds.) CAI 2013. LNCS, vol. 8080, pp. 147\u2013159. Springer, Heidelberg (2013)"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D Freeman","year":"2010","unstructured":"Freeman, D., Scott, M., Teske, E.: A Taxonomy of Pairing-Friendly Elliptic Curves. J. Cryptol. 23, 224\u2013280 (2010)","journal-title":"J. Cryptol."},{"issue":"206","key":"13_CR8","first-page":"865","volume":"62","author":"G Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.-G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comput. 62(206), 865\u2013874 (1994)","journal-title":"Math. Comput."},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.ffa.2007.02.003","volume":"13","author":"SD Galbraith","year":"2007","unstructured":"Galbraith, S.D., McKee, J.F., Valen\u00e7a, P.C.: Ordinary abelian varieties having small embedding degree. Finite Fields and their Applications 13(4), 800\u2013814 (2007)","journal-title":"Finite Fields and their Applications"},{"key":"13_CR10","unstructured":"Grillet, P.A.: Abstract Algebra. Springer (July 2007)"},{"key":"13_CR11","unstructured":"Jameson, G.: The cyclotomic polynomials. http:\/\/www.maths.lancs.ac.uk\/ jameson\/cyp.pdf"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Algorithmic Number Theory","author":"A Joux","year":"2000","unstructured":"Joux, A.: A one round protocol for tripartite diffie\u2013hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 385\u2013393. Springer, Heidelberg (2000)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-540-79456-1_6","volume-title":"Algorithmic Number Theory","author":"K Karabina","year":"2008","unstructured":"Karabina, K., Teske, E.: On prime-order elliptic curves with embedding degrees k = 3, 4, and 6. In: van der Poorten, A.J., Stein, A. (eds.) ANTS-VIII 2008. LNCS, vol. 5011, pp. 102\u2013117. Springer, Heidelberg (2008)"},{"issue":"10","key":"13_CR14","doi-asserted-by":"publisher","first-page":"2626","DOI":"10.1109\/TC.2013.125","volume":"63","author":"D-P Le","year":"2014","unstructured":"Le, D.-P., Tan, C.H.: Improved Miller\u2019s Algorithm for Computing Pairings on Edwards Curves. IEEE Transactions on Computers 63(10), 2626\u20132632 (2014)","journal-title":"IEEE Transactions on Computers"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Menezes, A., Vanstone, S., Okamoto, T.: Reducing elliptic curve logarithms to logarithms in a finite field. In: STOC 1991: Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, pp. 80\u201389. ACM, New York (1991)","DOI":"10.1145\/103418.103434"},{"issue":"5","key":"13_CR16","first-page":"1234","volume":"84","author":"A Miyaji","year":"2001","unstructured":"Miyaji, A., Nakabayashi, M., Takano, S.: New Explicit Conditions of Elliptic Curve Traces for FR-Reduction. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 84(5), 1234\u20131243 (2001)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"issue":"5","key":"13_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s00200-006-0017-6","volume":"17","author":"D Page","year":"2006","unstructured":"Page, D., Smart, N., Vercauteren, F.: A comparison of MNT curves and supersingular curves. Applicable Algebra in Engineering, Communication and Computing 17(5), 379\u2013392 (2006)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10623-005-0538-1","volume":"38","author":"M Scott","year":"2006","unstructured":"Scott, M., Barreto, P.S.: Generating More MNT Elliptic Curves. Des. Codes Cryptography 38, 209\u2013217 (2006)","journal-title":"Des. Codes Cryptography"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23021-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T16:23:24Z","timestamp":1675873404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23021-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319230207","9783319230214"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23021-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}