{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:20:37Z","timestamp":1726410037824},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137969"},{"type":"electronic","value":"9783642137976"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13797-6_14","type":"book-chapter","created":{"date-parts":[[2010,6,24]],"date-time":"2010-06-24T10:49:56Z","timestamp":1277376596000},"page":"196-214","source":"Crossref","is-referenced-by-count":0,"title":["Delaying Mismatched Field Multiplications 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":"Gonzalez Nieto","sequence":"additional","affiliation":[]},{"given":"Kenneth Koon-Ho","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_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":"14_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)"},{"issue":"4","key":"14_CR3","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":"14_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.E. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/978-3-642-13797-6_13","volume-title":"WAIFI 2010","author":"N. Benger","year":"2010","unstructured":"Benger, N., Scott, M.: Constructing tower extensions for the implementation of pairing-based cryptography. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol.\u00a06087, pp. 180\u2013195. Springer, Heidelberg (2010)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11745853_14","volume-title":"Public Key Cryptography - PKC 2006","author":"D.J. Bernstein","year":"2006","unstructured":"Bernstein, D.J.: Curve25519: New diffie-hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 207\u2013228. Springer, Heidelberg (2006)"},{"key":"14_CR7","unstructured":"Bernstein, D.J., Lange, T.: Explicit-formulas database, \n                    \n                      http:\/\/www.hyperelliptic.org\/EFD"},{"key":"14_CR8","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)"},{"key":"14_CR9","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":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-12678-9_13","volume-title":"AFRICACRYPT 2010","author":"C. Costello","year":"2010","unstructured":"Costello, C., Boyd, C., Nieto, J.M.G., Wong, K.K.-H.: Avoiding full extension field arithmetic in pairing computations. In: Bernstein, D.J., Lange, T. (eds.) AFRICACRYPT 2010. LNCS, vol.\u00a06055, pp. 203\u2013224. Springer, Heidelberg (2010)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-642-03298-1_7","volume-title":"Pairing","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. (ed.) Pairing 2009. LNCS, vol.\u00a05671, pp. 89\u2013101. Springer, Heidelberg (2009)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-13013-7_14","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: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 209\u2013223. Springer, Heidelberg (2010)"},{"key":"14_CR13","unstructured":"Prem Laxman Das, M., Sarkar, P.: Pairing computation on twisted Edwards form elliptic curves. In: Galbraith, Paterson (eds.) [17], pp. 192\u2013210 (2008)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-02620-1_29","volume-title":"Information Security and Privacy","author":"N. Mrabet El","year":"2009","unstructured":"El Mrabet, N., Negre, C.: Finite field multiplication combining AMNS and DFT approach for pairing cryptography. In: Boyd, C., Gonz\u00e1lez Nieto, J. (eds.) ACISP 2009. LNCS, vol.\u00a05594, pp. 422\u2013436. Springer, Heidelberg (2009)"},{"key":"14_CR15","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. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 452\u2013465. Springer, Heidelberg (2006)"},{"issue":"2","key":"14_CR16","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":"14_CR17","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":"14_CR18","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1112\/S1461157000001194","volume":"9","author":"R. Granger","year":"2006","unstructured":"Granger, R., Page, D., Stam, M.: On small characteristic algebraic tori in pairing-based cryptography. LMS J. Comput. Math.\u00a09, 64\u201385 (2006)","journal-title":"LMS J. Comput. Math."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Hess, F.: Pairing lattices. In: Galbraith, Paterson (eds.) [17], pp. 18\u201338","DOI":"10.1007\/978-3-540-85538-5_2"},{"issue":"10","key":"14_CR20","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":"14_CR21","unstructured":"Hisil, H.: Elliptic Curves, Group Law, and Efficient Computation. PhD thesis, Queensland University of Technology (2010)"},{"key":"14_CR22","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":"14_CR23","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":"14_CR24","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":"14_CR25","doi-asserted-by":"crossref","first-page":"2387","DOI":"10.1093\/ietfec\/e91-a.9.2387","volume":"91","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"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-77272-9_18","volume-title":"Cryptography and Coding","author":"S. Matsuda","year":"2007","unstructured":"Matsuda, S., Kanayama, N., Hess, F., Okamoto, E.: Optimised versions of the ate and twisted ate pairings. In: Galbraith, S.D. (ed.) Cryptography and Coding 2007. LNCS, vol.\u00a04887, pp. 302\u2013312. Springer, Heidelberg (2007)"},{"key":"14_CR27","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"},{"issue":"3","key":"14_CR28","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/TC.2005.49","volume":"54","author":"P.L. Montgomery","year":"2005","unstructured":"Montgomery, P.L.: Five, six, and seven-term Karatsuba-like formulae. IEEE Trans. Computers\u00a054(3), 362\u2013369 (2005)","journal-title":"IEEE Trans. Computers"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-540-28628-8_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M. Scott","year":"2004","unstructured":"Scott, M., Barreto, P.S.L.M.: Compressed pairings. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 140\u2013156. Springer, Heidelberg (2004)"},{"issue":"2","key":"14_CR30","doi-asserted-by":"publisher","first-page":"129","DOI":"10.4218\/etrij.09.0108.0317","volume":"31","author":"M. Shirase","year":"2009","unstructured":"Shirase, M., Takagi, T., Choi, D., Han, D.G., Kim, H.: Efficient computation of Eta pairing over binary field with Vandermonde matrix. ETRI journal\u00a031(2), 129\u2013139 (2009)","journal-title":"ETRI journal"},{"issue":"1","key":"14_CR31","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":"14_CR32","unstructured":"Weimerskirch, A., Paar, C.: Generalizations of the Karatsuba algorithm for efficient implementations. Cryptology ePrint Archive, Report 2006\/224 (2006), \n                    \n                      http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13797-6_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:13:04Z","timestamp":1619784784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13797-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137969","9783642137976"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13797-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}