{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:07:57Z","timestamp":1725552477297},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642126772"},{"type":"electronic","value":"9783642126789"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12678-9_13","type":"book-chapter","created":{"date-parts":[[2010,4,29]],"date-time":"2010-04-29T07:28:35Z","timestamp":1272526115000},"page":"203-224","source":"Crossref","is-referenced-by-count":4,"title":["Avoiding Full Extension Field Arithmetic in Pairing Computations"],"prefix":"10.1007","author":[{"given":"Craig","family":"Costello","sequence":"first","affiliation":[]},{"given":"Colin","family":"Boyd","sequence":"additional","affiliation":[]},{"given":"Juan Manuel","family":"Gonz\u00e1lez Nieto","sequence":"additional","affiliation":[]},{"given":"Kenneth Koon-Ho","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Arene, C., Lange, T., Naehrig, M., Ritzenthaler, C.: Faster pairing computation. Cryptology ePrint Archive, Report 2009\/155 (2009), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"13_CR2","volume-title":"The Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"R.M. Avanzi","year":"2005","unstructured":"Avanzi, R.M., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: The Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC, Boca Raton (2005)"},{"issue":"3","key":"13_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., O\u2019Eigeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Des. Codes Cryptography\u00a042(3), 239\u2013271 (2007)","journal-title":"Des. Codes Cryptography"},{"key":"13_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":"13_CR5","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":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-540-24654-1_2","volume-title":"Selected Areas in Cryptography","author":"P.S.L.M. Barreto","year":"2004","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: On the selection of pairing-friendly groups. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol.\u00a03006, pp. 17\u201325. Springer, Heidelberg (2004)"},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00145-004-0311-z","volume":"17","author":"P.S.L.M. Barreto","year":"2004","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Efficient implementation of pairing-based cryptosystems. J. Cryptology\u00a017(4), 321\u2013334 (2004)","journal-title":"J. Cryptology"},{"key":"13_CR8","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.E. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"key":"13_CR9","unstructured":"Benger, N., Scott, M.: Constructing tower extensions for the implementation of pairing-based cryptography. Cryptology ePrint Archive, Report 2009\/556 (2009), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"13_CR10","unstructured":"Benits Jr., W.D., Galbraith, S.D.: Constructing pairing-friendly elliptic curves using Gr\u00f6bner basis reduction. In: Galbraith, S.D. (ed.) [23], pp. 336\u2013345"},{"key":"13_CR11","unstructured":"Bernstein, D.J., Lange, T.: Explicit-formulas database, \n                    \n                      http:\/\/www.hyperelliptic.org\/EFD"},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jalgor.2005.01.009","volume":"58","author":"I.F. Blake","year":"2006","unstructured":"Blake, I.F., Kumar Murty, V., Xu, G.: Refinements of miller\u2019s algorithm for computing the weil\/tate pairing. J. Algorithms\u00a058(2), 134\u2013149 (2006)","journal-title":"J. Algorithms"},{"key":"13_CR13","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.K.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10623-004-3808-4","volume":"37","author":"F. Brezing","year":"2005","unstructured":"Brezing, F., Weng, A.: Elliptic curves suitable for pairing based cryptography. Des. Codes Cryptography\u00a037(1), 133\u2013141 (2005)","journal-title":"Des. Codes Cryptography"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/11496618_13","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"S. Chatterjee","year":"2005","unstructured":"Chatterjee, S., Sarkar, P., Barua, R.: Efficient computation of Tate pairing in projective coordinate over general characteristic fields. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 168\u2013181. Springer, Heidelberg (2005)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-03298-1_7","volume-title":"Pairing 2009","author":"C. Costello","year":"2009","unstructured":"Costello, C., Hisil, H., Boyd, C., Nieto, J.M.G., Wong, K.K.-H.: Faster pairings on special Weierstrass curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 92\u2013109. Springer, Heidelberg (2009)"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"PKC 2010","author":"C. Costello","year":"2010","unstructured":"Costello, C., Lange, T., Naehrig, M.: Faster pairing computations on curves with high-degree twists. In: PKC 2010. LNCS. Springer, Heidelberg (to appear, 2010)"},{"key":"13_CR18","unstructured":"Prem Laxman Das, M., Sarkar, P.: Pairing computation on twisted Edwards form elliptic curves. In: Galbraith, S.D., Paterson, K.G. (eds.) [25], 192\u2013210"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-540-40061-5_7","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"I.M. Duursma","year":"2003","unstructured":"Duursma, I.M., Lee, H.-S.: Tate pairing implementation for hyperelliptic curves y\n                    \n                      \n                    \n                    $^{\\mbox{2}}$\n                   = x\n                    \n                      \n                    \n                    $^{\\mbox{p}}$\n                  -x + d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 111\u2013123. Springer, Heidelberg (2003)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/11792086_32","volume-title":"Algorithmic Number Theory","author":"D. Freeman","year":"2006","unstructured":"Freeman, D.: Constructing pairing-friendly elliptic curves with embedding degree 10. In: Hess, F., Pauli, S., Pohst, M.E. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 452\u2013465. Springer, Heidelberg (2006)"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Freeman, D.: A generalized Brezing-Weng algorithm for constructing pairing-friendly ordinary abelian varieties. In: Galbraith, S.D., Paterson, K.G. (eds.) [25], pp. 146\u2013163","DOI":"10.1007\/978-3-540-85538-5_11"},{"issue":"2","key":"13_CR22","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"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"Cryptography and Coding","year":"2007","unstructured":"Galbraith, S.D. (ed.): Cryptography and Coding 2007. LNCS, vol.\u00a04887. Springer, Heidelberg (2007)"},{"key":"13_CR24","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.F., Valen\u00e7a, P.C.: Ordinary abelian varieties having small embedding degree. Finite Fields and their Applications\u00a013, 800\u2013814 (2007)","journal-title":"Finite Fields and their Applications"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","year":"2008","unstructured":"Galbraith, S.D., Paterson, K.G. (eds.): Pairing 2008. LNCS, vol.\u00a05209. Springer, Heidelberg (2008)"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Hess, F.: Pairing lattices. In: Galbraith, S.D., Paterson, K.G. (eds.) [25], pp. 18\u201338","DOI":"10.1007\/978-3-540-85538-5_2"},{"issue":"10","key":"13_CR27","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":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-540-89754-5_31","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"S. Ionica","year":"2008","unstructured":"Ionica, S., Joux, A.: Another approach to pairing computation in Edwards coordinates. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol.\u00a05365, pp. 400\u2013413. Springer, Heidelberg (2008), \n                    \n                      http:\/\/eprint.iacr.org\/2008\/292"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","volume-title":"Topics in Cryptology - CT-RSA 2003","year":"2003","unstructured":"Joye, M. (ed.): CT-RSA 2003. LNCS, vol.\u00a02612. Springer, Heidelberg (2003)"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Kachisa, E.J., Schaefer, E.F., Scott, M.: Constructing Brezing-Weng pairing-friendly elliptic curves using elements in the cyclotomic field. In: Galbraith, S.D., Paterson, K.G. (eds.) [25], pp. 126\u2013135","DOI":"10.1007\/978-3-540-85538-5_9"},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11586821_2","volume-title":"Cryptography and Coding","author":"N. Koblitz","year":"2005","unstructured":"Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 13\u201336. Springer, Heidelberg (2005)"},{"issue":"4","key":"13_CR32","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"},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Matsuda, S., Kanayama, N., Hess, F., Okamoto, E.: Optimised versions of the ate and twisted ate pairings. In: Galbraith, S.D. (ed.) [23], pp. 302\u2013312","DOI":"10.1007\/978-3-540-77272-9_18"},{"key":"13_CR34","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. Journal of Cryptology\u00a017, 235\u2013261 (2004)","journal-title":"Journal of Cryptology"},{"key":"13_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-3-540-30574-3_20","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"M. Scott","year":"2005","unstructured":"Scott, M.: Computing the Tate pairing. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 293\u2013304. Springer, Heidelberg (2005)"},{"issue":"2","key":"13_CR36","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. Des. Codes Cryptography\u00a038(2), 209\u2013217 (2006)","journal-title":"Des. Codes Cryptography"},{"issue":"1","key":"13_CR37","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"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12678-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:44:47Z","timestamp":1619768687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12678-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642126772","9783642126789"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12678-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}