{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:39:32Z","timestamp":1742913572675,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319547046"},{"type":"electronic","value":"9783319547053"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-54705-3_25","type":"book-chapter","created":{"date-parts":[[2017,3,2]],"date-time":"2017-03-02T09:03:43Z","timestamp":1488445423000},"page":"403-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\\rho =1$$"],"prefix":"10.1007","author":[{"given":"Meng","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maozhi","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,3]]},"reference":[{"issue":"203","key":"25_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1090\/S0025-5718-1993-1199989-X","volume":"61","author":"AOL Atkin","year":"1997","unstructured":"Atkin, A.O.L., Morain, F.: Elliptic curves and primality proving. Math. Comput. 61(203), 29\u201368 (1997)","journal-title":"Math. Comput."},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s001459900040","volume":"11","author":"R Balasubramanian","year":"1998","unstructured":"Balasubramanian, R., Koblitz, N.: The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm. J. Crypt. 11(2), 141\u2013145 (1998)","journal-title":"J. Crypt."},{"issue":"3","key":"25_CR3","first-page":"213","volume":"32","author":"B Dan","year":"2003","unstructured":"Dan, B., Franklin, M.: Identity-based encryption from the Weil pairing. SIAM J. Comput. 32(3), 213\u2013229 (2003)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"25_CR4","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. Crypt. 23(2), 224\u2013280 (2010)","journal-title":"J. Crypt."},{"key":"25_CR5","first-page":"865","volume":"62","author":"G Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comput. 62, 865\u2013874 (1994)","journal-title":"Math. Comput."},{"issue":"4","key":"25_CR6","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., Valena, P.C.: Ordinary abelian varieties having small embedding degree. Finite Fields Appl. 13(4), 800\u2013814 (2007)","journal-title":"Finite Fields Appl."},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-662-44381-1_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"R Granger","year":"2014","unstructured":"Granger, R., Kleinjung, T., Zumbr\u00e4gel, J.: Breaking \u2018128-bit secure\u2019 supersingular binary curves. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 126\u2013145. Springer, Heidelberg (2014). doi:\n                      10.1007\/978-3-662-44381-1_8"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-34961-4_5","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"T Hayashi","year":"2012","unstructured":"Hayashi, T., Shimoyama, T., Shinohara, N., Takagi, T.: Breaking pairing-based cryptosystems using \n                      \n                        \n                      \n                      $$\\eta _T$$\n                     pairing over GF(\n                      \n                        \n                      \n                      $$3^97$$\n                    ). In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 43\u201360. Springer, Heidelberg (2012). doi:\n                      10.1007\/978-3-642-34961-4_5"},{"issue":"4","key":"25_CR9","first-page":"385","volume":"17","author":"A Joux","year":"2006","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. J. Crypt. 17(4), 385\u2013393 (2006)","journal-title":"J. Crypt."},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10623-015-0147-6","volume":"78","author":"A Joux","year":"2016","unstructured":"Joux, A., Pierrot, C.: Technical history of discrete logarithms in small characteristic finite fields - the road from subexponential to quasi-polynomial complexity. Des. Codes Crypt. 78(1), 73\u201385 (2016)","journal-title":"Des. Codes Crypt."},{"issue":"5","key":"25_CR11","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"AJ Menezes","year":"1993","unstructured":"Menezes, A.J., Okamoto, T., Vanstone, S.A.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inf. Theor. 39(5), 1639\u20131646 (1993)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"5","key":"25_CR12","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-reductions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 84(5), 1234\u20131243 (2001)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1049\/el:20020682","volume":"38","author":"K Paterson","year":"2002","unstructured":"Paterson, K.: ID-based signatures from pairings on elliptic curves. Electron. Lett. 38, 1025\u20131026 (2002)","journal-title":"Electron. Lett."},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-85538-5_10","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"S Tanaka","year":"2008","unstructured":"Tanaka, S., Nakamula, K.: Constructing pairing-friendly elliptic curves using factorization of cyclotomic polynomials. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 136\u2013145. Springer, Heidelberg (2008). doi:\n                      10.1007\/978-3-540-85538-5_10"},{"issue":"278","key":"25_CR15","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1090\/S0025-5718-2011-02543-3","volume":"81","author":"JJ Urroz","year":"2012","unstructured":"Urroz, J.J., Shparlinski, I.E.: On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves. Math. Comput. 81(278), 1093\u20131110 (2012)","journal-title":"Math. Comput."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-54705-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:50:19Z","timestamp":1558317019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-54705-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319547046","9783319547053"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-54705-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"3 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Inscrypt","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisc2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.inscrypt.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}