{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:56:22Z","timestamp":1764996982275},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406621"},{"type":"electronic","value":"9783642406638"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40663-8_15","type":"book-chapter","created":{"date-parts":[[2013,8,20]],"date-time":"2013-08-20T01:03:57Z","timestamp":1376960637000},"page":"147-159","source":"Crossref","is-referenced-by-count":4,"title":["On the Efficient Generation of Generalized MNT Elliptic Curves"],"prefix":"10.1007","author":[{"given":"Georgios","family":"Fotiadis","sequence":"first","affiliation":[]},{"given":"Elisavet","family":"Konstantinou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1090\/S0025-5718-1993-1199989-X","volume":"61","author":"A.O.L. Atkin","year":"1993","unstructured":"Atkin, A.O.L., Morain, F.: Elliptic Curves and Primality Proving. Mathematics of Computation\u00a061, 29\u201368 (1993)","journal-title":"Mathematics of Computation"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"P.S.L.M. Barreto","year":"2002","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient Algorithms for Pairing-Based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 354\u2013368. Springer, Heidelberg (2002)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-36413-7_19","volume-title":"Security in Communication Networks","author":"P.S.L.M. Barreto","year":"2003","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing Elliptic Curves with Prescribed Embedding Degrees. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 257\u2013267. Springer, Heidelberg (2003)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"P.S.L.M. Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-Friendly Elliptic Curves of Prime Order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. SIAM Journal of Computing\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM Journal of Computing"},{"key":"15_CR6","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)"},{"issue":"2","key":"15_CR7","first-page":"157","volume":"2","author":"P. Duan","year":"2005","unstructured":"Duan, P., Cui, S., Wah Chan, C.: Finding More Non-Supersingular Elliptic Curves for Pairing-Based Cryptosystems. International Journal of Information Technology\u00a02(2), 157\u2013163 (2005)","journal-title":"International Journal of Information Technology"},{"key":"15_CR8","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. Journal of Cryptology\u00a023, 224\u2013280 (2010)","journal-title":"Journal of Cryptology"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","volume-title":"Algorithmic Number Theory","author":"S.D. Galbraith","year":"2002","unstructured":"Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the Tate Pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 324\u2013337. Springer, Heidelberg (2002)"},{"issue":"4","key":"15_CR10","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.ffa.2007.02.003","volume":"13","author":"S.D. Galbraith","year":"2007","unstructured":"Galbraith, S.D., McKee, J., Valen\u00e7a, P.: Ordinary Abelian Varieties Having Small Embedding Degree. Finite Fields and Their Applications\u00a013(4), 800\u2013814 (2007)","journal-title":"Finite Fields and Their Applications"},{"key":"15_CR11","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.\u00a05011, pp. 102\u2013117. Springer, Heidelberg (2008)"},{"key":"15_CR12","unstructured":"Miyaji, A., Nakabayashi, M., Takano, S.: New Explicit Conditions of Elliptic Curve Traces for FR-Reduction. IEICE Transactions Fundamentals E84-A(5), 1234\u20131243 (2001)"},{"key":"15_CR13","volume-title":"Fundamental Number Theory with Applications","author":"R.A. Mollin","year":"1998","unstructured":"Mollin, R.A.: Fundamental Number Theory with Applications. CRC Press, Boca Raton (1998)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0723-0869(01)80015-3","volume":"19","author":"R.A. Mollin","year":"2001","unstructured":"Mollin, R.A.: Simple Continued Fraction Solutions for Diophantine Equations. Expositiones Mathematicae\u00a019, 55\u201373 (2001)","journal-title":"Expositiones Mathematicae"},{"key":"15_CR15","unstructured":"Robertson, J.P.: Solving the Generalized Pell Equation x\n                  2\u2009\u2212\u2009Dy\n                  2\u2009=\u2009N (2004), \n                    \n                      http:\/\/hometown.aol.com\/jpr2718\/"},{"key":"15_CR16","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.L.M.: Generating more MNT Elliptic Curves. Designs, Codes and Cryptography\u00a038, 209\u2013217 (2006)","journal-title":"Designs, Codes and Cryptography"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40663-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T18:30:47Z","timestamp":1558031447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40663-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406621","9783642406638"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40663-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}