{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:45:06Z","timestamp":1725770706002},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319048727"},{"type":"electronic","value":"9783319048734"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04873-4_6","type":"book-chapter","created":{"date-parts":[[2014,1,27]],"date-time":"2014-01-27T03:49:57Z","timestamp":1390794597000},"page":"97-112","source":"Crossref","is-referenced-by-count":7,"title":["Constructing Symmetric Pairings over Supersingular Elliptic Curves with Embedding Degree Three"],"prefix":"10.1007","author":[{"given":"Tadanori","family":"Teruya","sequence":"first","affiliation":[]},{"given":"Kazutaka","family":"Saito","sequence":"additional","affiliation":[]},{"given":"Naoki","family":"Kanayama","sequence":"additional","affiliation":[]},{"given":"Yuto","family":"Kawahara","sequence":"additional","affiliation":[]},{"given":"Tetsutaro","family":"Kobayashi","sequence":"additional","affiliation":[]},{"given":"Eiji","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"LNCS","first-page":"19","volume-title":"Pairing 2013","author":"G. Adj","year":"2014","unstructured":"Adj, G., et al.: Weakness of \n                  \n                    \n                  \n                  $\\mathbb{F}_{3^{6.509}}$\n                 for discrete logarithm cryptography. In: Cao, Z., Zhang, F. (eds.) Pairing 2013. LNCS, vol.\u00a08365, pp. 19\u201343. Springer, Heidelberg (2014)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-58691-1_48","volume-title":"Algorithmic Number Theory","author":"L.M. Adleman","year":"1994","unstructured":"Adleman, L.M.: The function field sieve. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol.\u00a0877, pp. 108\u2013121. Springer, Heidelberg (1994)"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P.S.L.M. Barreto","year":"2007","unstructured":"Barreto, P.S.L.M., Galbraith, S.D., \u00d3h\u00c9igeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Des. Codes Cryptography\u00a042(3), 239\u2013271 (2007)","journal-title":"Des. Codes Cryptography"},{"key":"6_CR4","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":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-17455-1_2","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"J.-L. Beuchat","year":"2010","unstructured":"Beuchat, J.-L., Gonz\u00e1lez-D\u00edaz, J.E., Mitsunari, S., Okamoto, E., Rodr\u00edguez-Henr\u00edquez, F., Teruya, T.: High-speed software implementation of the optimal ate pairing over barreto\u2013naehrig curves. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 21\u201339. Springer, Heidelberg (2010)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. In: [19], pp. 213\u2013229","DOI":"10.1007\/3-540-44647-8_13"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. SIAM J. Comput.\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM J. Comput."},{"issue":"3-4","key":"6_CR8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput.\u00a024(3-4), 235\u2013265 (1997); Computational algebra and number theory, London (1993)","journal-title":"J. Symbolic Comput."},{"issue":"2-3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10623-009-9334-7","volume":"55","author":"S. Chatterjee","year":"2010","unstructured":"Chatterjee, S., Hankerson, D., Knapp, E., Menezes, A.: Comparing two pairing-based aggregate signature schemes. Des. Codes Cryptography\u00a055(2-3), 141\u2013167 (2010)","journal-title":"Des. Codes Cryptography"},{"issue":"2","key":"6_CR10","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. Cryptology\u00a023(2), 224\u2013280 (2010)","journal-title":"J. Cryptology"},{"issue":"16","key":"6_CR11","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"S.D. Galbraith","year":"2008","unstructured":"Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for cryptographers. Discrete Applied Mathematics\u00a0156(16), 3113\u20133121 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Gallant, R., Lambert, R., Vanstone, S.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: [19], pp. 190\u2013200 (2001)","DOI":"10.1007\/3-540-44647-8_11"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1090\/S0025-5718-06-01900-4","volume":"76","author":"P. Gaudry","year":"2004","unstructured":"Gaudry, P., Thom\u00e9, E., Th\u00e9riault, N., Diem, C.: A double large prime variation for small genus hyperelliptic index calculus. Mathematics of Computation\u00a076, 475\u2013492 (2004)","journal-title":"Mathematics of Computation"},{"key":"6_CR14","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A.J., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer-Verlag New York, Inc., Secaucus (2004)"},{"key":"6_CR15","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., et al.: Breaking pairing-based cryptosystems using \u03b7\n                \n                  T\n                 pairing over GF(397). In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 43\u201360. Springer, Heidelberg (2012)"},{"issue":"10","key":"6_CR16","doi-asserted-by":"publisher","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F. Hess","year":"2006","unstructured":"Hess, F., Smart, N.P., Vercauteren, F.: The eta pairing revisited. IEEE Transactions on Information Theory\u00a052(10), 4595\u20134602 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR17","unstructured":"Joux, A.: Discrete logarithms in GF(26168)\u00a0[ = GF((2257)24)]. NMBRTHRY list (May 21, 2013), \n                  \n                    https:\/\/listserv.nodak.edu\/cgi-bin\/wa.exe?A2=NMBRTHRY;49bb494e.1305"},{"key":"6_CR18","series-title":"LNCS","first-page":"45","volume-title":"Pairing 2013","author":"A. Joux","year":"2014","unstructured":"Joux, A., Pierrot, C.: The special number field sieve in \n                  \n                    \n                  \n                  $\\mathbb{F}_{p^{n}}$\n                , application to pairing-friendly constructions. In: Cao, Z., Zhang, F. (eds.) Pairing 2013. LNCS, vol.\u00a08365, pp. 45\u201361. Springer, Heidelberg (2014)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 2001","year":"2001","unstructured":"Kilian, J. (ed.): CRYPTO 2001. LNCS, vol.\u00a02139. Springer, Heidelberg (2001)"},{"issue":"4","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1109\/TIT.2009.2013048","volume":"55","author":"E. Lee","year":"2009","unstructured":"Lee, E., Lee, H.S., Park, C.M.: Efficient and generalized pairing computation on abelian varieties. IEEE Transactions on Information Theory\u00a055(4), 1793\u20131803 (2009)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"6_CR21","doi-asserted-by":"publisher","first-page":"2387","DOI":"10.1093\/ietfec\/e91-a.9.2387","volume":"91-A","author":"X. Lin","year":"2008","unstructured":"Lin, X., Zhao, C., Zhang, F., Wang, Y.: Computing the ate pairing on elliptic curves with embedding degree k\u2009=\u20099. IEICE Transactions\u00a091-A(9), 2387\u20132393 (2008)","journal-title":"IEICE Transactions"},{"issue":"4","key":"6_CR22","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V.S. Miller","year":"2004","unstructured":"Miller, V.S.: The Weil pairing, and its efficient calculation. J. Cryptology\u00a017(4), 235\u2013261 (2004)","journal-title":"J. Cryptology"},{"key":"6_CR23","unstructured":"Momose, F., Chao, J.: Scholten forms and elliptic\/hyperelliptic curves with weak Weil restrictions. Cryptology ePrint Archive, Report 2005\/277 (2005), \n                  \n                    http:\/\/eprint.iacr.org\/2005\/277"},{"key":"6_CR24","unstructured":"Nagao, K.: Improvement of Th\u00e9riault algorithm of index calculus for Jacobian of hyperelliptic curves of small genus. Cryptology ePrint Archive, Report 2004\/161 (2004), \n                  \n                    http:\/\/eprint.iacr.org\/2004\/161"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Ogura, N., Uchiyama, S., Kanayama, N., Okamoato, E.: A note on the pairing computation using normalized Miller functions. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E95-A(1), 196\u2013203 (2012)","DOI":"10.1587\/transfun.E95.A.196"},{"key":"6_CR26","unstructured":"Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: 2000 Symposium on Cryptography and Information Security (SCIS 2000), pp. 26\u201328 (January 2000) C20"},{"key":"6_CR27","unstructured":"Scholten, J.: Weil restriction of an elliptic curve over a quadratic extension (2003) (preprint), \n                  \n                    http:\/\/www.esat.kuleuven.ac.be\/~jscholte\/weilres.ps"},{"issue":"1","key":"6_CR28","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F. Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Transactions on Information Theory\u00a056(1), 455\u2013461 (2010)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-44987-6_13","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"E.R. Verheul","year":"2001","unstructured":"Verheul, E.R.: Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 195\u2013210. Springer, Heidelberg (2001)"},{"issue":"4","key":"6_CR30","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00145-004-0313-x","volume":"17","author":"E.R. Verheul","year":"2004","unstructured":"Verheul, E.R.: Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. J. Cryptology\u00a017(4), 277\u2013296 (2004)","journal-title":"J. Cryptology"},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B. Waters","year":"2005","unstructured":"Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 114\u2013127. Springer, Heidelberg (2005)"},{"issue":"6","key":"6_CR32","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10207-008-0054-1","volume":"7","author":"C. Zhao","year":"2008","unstructured":"Zhao, C., Zhang, F., Huang, J.: A note on the ate pairing. Int. J. Inf. Sec.\u00a07(6), 379\u2013382 (2008)","journal-title":"Int. J. Inf. Sec."}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography \u2013 Pairing 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04873-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T04:45:47Z","timestamp":1558845947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04873-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319048727","9783319048734"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04873-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}