{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:24:47Z","timestamp":1742401487546},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642104329"},{"type":"electronic","value":"9783642104336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10433-6_28","type":"book-chapter","created":{"date-parts":[[2009,11,22]],"date-time":"2009-11-22T22:20:51Z","timestamp":1258928451000},"page":"413-432","source":"Crossref","is-referenced-by-count":33,"title":["Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves"],"prefix":"10.1007","author":[{"given":"Jean-Luc","family":"Beuchat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"L\u00f3pez-Trejo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Mart\u00ednez-Ramos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeo","family":"Mitsunari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Rodr\u00edguez-Henr\u00edquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadi, O., Rodr\u00edguez-Henr\u00edquez, F.: Low complexity cubing and cube root computation over $\\mathbb{F}_{3^m}$ in standard basis. Cryptology ePrint Archive, Report 2009\/070 (2009)","DOI":"10.1109\/TC.2009.183"},{"key":"28_CR2","unstructured":"Barreto, P.S.L.M.: A note on efficient computation of cube roots in characteristic 3. Cryptology ePrint Archive, Report 2004\/305 (2004)"},{"key":"28_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., \u00d3 h\u00c9igeartaigh, C., Scott, M.: Efficient pairing computation on supersingular Abelian varieties. Designs, Codes and Cryptography\u00a042, 239\u2013271 (2007)","journal-title":"Designs, Codes and Cryptography"},{"key":"28_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":"28_CR5","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)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-85538-5_20","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"J.-L. Beuchat","year":"2008","unstructured":"Beuchat, J.-L., Brisebarre, N., Detrey, J., Okamoto, E., Rodr\u00edguez-Henr\u00edquez, F.: A comparison between hardware accelerators for the modified tate pairing over $\\mathbb{F}_{2^m}$ and $\\mathbb{F}_{3^m}$ . In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 297\u2013315. Springer, Heidelberg (2008)"},{"issue":"11","key":"28_CR7","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1109\/TC.2008.103","volume":"57","author":"J.-L. Beuchat","year":"2008","unstructured":"Beuchat, J.-L., Brisebarre, N., Detrey, J., Okamoto, E., Shirase, M., Takagi, T.: Algorithms and arithmetic operators for computing the \u03b7 T pairing in characteristic three. IEEE Transactions on Computers\u00a057(11), 1454\u20131468 (2008)","journal-title":"IEEE Transactions on Computers"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/978-3-642-04138-9_17","volume-title":"CHES 2009","author":"J.-L. Beuchat","year":"2009","unstructured":"Beuchat, J.-L., Detrey, J., Estibals, N., Okamoto, E., Rodr\u00edguez-Henr\u00edquez, F.: Hardware accelerator for the Tate pairing in characteristic three based on Karatsuba\u2013Ofman multipliers. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol.\u00a05747, pp. 225\u2013239. Springer, Heidelberg (2009)"},{"key":"28_CR9","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. Duursma","year":"2003","unstructured":"Duursma, I., Lee, H.S.: Tate pairing implementation for hyperelliptic curves y 2\u2009=\u2009x p \u2009\u2212\u2009x\u2009+\u2009d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 111\u2013123. Springer, Heidelberg (2003)"},{"issue":"8","key":"28_CR10","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1109\/TC.2004.43","volume":"53","author":"K. Fong","year":"2004","unstructured":"Fong, K., Hankerson, D., L\u00f3pez, J., Menezes, A.: Field inversion and point halving revisited. IEEE Transactions on Computers\u00a053(8), 1047\u20131059 (2004)","journal-title":"IEEE Transactions on Computers"},{"key":"28_CR11","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)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","first-page":"34","volume-title":"SAC 2008","author":"P. Grabher","year":"2008","unstructured":"Grabher, P., Gro\u00dfsch\u00e4dl, J., Page, D.: On software parallel implementation of cryptographic pairings. In: SAC 2008. LNCS, vol.\u00a05381, pp. 34\u201349. Springer, Heidelberg (2008)"},{"key":"28_CR13","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 Journal of Computation and Mathematics\u00a09, 64\u201385 (2006)","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"28_CR14","unstructured":"Gueron, S., Kounavis, M.E.: Carry-less multiplication and its usage for computing the GCM mode. Intel Corporation White Paper (May 2009)"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44499-8_1","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2000","author":"D. Hankerson","year":"2000","unstructured":"Hankerson, D., L\u00f3pez Hernandez, J., Menezes, A.J.: Software implementation of elliptic curve cryptography over binary fields. In: Paar, C., Ko\u00e7, \u00c7.K. (eds.) CHES 2000. LNCS, vol.\u00a01965, pp. 1\u201324. Springer, Heidelberg (2000)"},{"key":"28_CR16","series-title":"Cryptology and Information Security Series","first-page":"188","volume-title":"Software Implementation of Pairings","author":"D. Hankerson","year":"2009","unstructured":"Hankerson, D., Menezes, A., Scott, M.: Software Implementation of Pairings. Cryptology and Information Security Series, ch.\u00a012, pp. 188\u2013206. IOS Press, Amsterdam (2009)"},{"key":"28_CR17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1112\/S1461157000000747","volume":"5","author":"K. Harrison","year":"2002","unstructured":"Harrison, K., Page, D., Smart, N.P.: Software implementation of finite fields of characteristic three, for use in pairing-based cryptosystems. LMS Journal of Computation and Mathematics\u00a05, 181\u2013193 (2002)","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-85538-5_2","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"F. Hess","year":"2008","unstructured":"Hess, F.: Pairing lattices. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 18\u201338. Springer, Heidelberg (2008)"},{"issue":"10","key":"28_CR19","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., Vercauteren, F.: The Eta pairing revisited. IEEE Transactions on Information Theory\u00a052(10), 4595\u20134602 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Kammler, D., Zhang, D., Schwabe, P., Scharwaechter, H., Langenberg, M., Auras, D., Ascheid, G., Leupers, R., Mathar, R., Meyr, H.: Designing an ASIP for cryptographic pairings over Barreto-Naehrig curves. Cryptology ePrint Archive, Report 2009\/056 (2009)","DOI":"10.1007\/978-3-642-04138-9_19"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-85538-5_19","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"Y. Kawahara","year":"2008","unstructured":"Kawahara, Y., Aoki, K., Takagi, T.: Faster implementation of \u03b7 T pairing over GF(3 m ) using minimum number of logical instructions for GF(3)-addition. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 282\u2013296. Springer, Heidelberg (2008)"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-44495-5_18","volume-title":"Progress in Cryptology - INDOCRYPT 2000","author":"J. L\u00f3pez","year":"2000","unstructured":"L\u00f3pez, J., Dahab, R.: High-speed software multiplication in $\\mathbb{F}_{2^m}$ . In: Roy, B.K., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol.\u00a01977, pp. 203\u2013212. Springer, Heidelberg (2000)"},{"key":"28_CR23","unstructured":"Miller, V.S.: Short programs for functions on curves (1986), http:\/\/crypto.stanford.edu\/miller"},{"issue":"4","key":"28_CR24","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(4), 235\u2013261 (2004)","journal-title":"Journal of Cryptology"},{"key":"28_CR25","unstructured":"\u00d3 h\u00c9igeartaigh, C.: Pairing Computation on Hyperelliptic Curves of Genus 2. PhD thesis, Dublin City University (2006)"},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/3-540-44750-4_4","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"R. Schroeppel","year":"1995","unstructured":"Schroeppel, R., Orman, H., O\u2019Malley, S.W., Spatscheck, O.: Fast key exchange with elliptic curve systems. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 43\u201356. Springer, Heidelberg (1995)"},{"issue":"2","key":"28_CR27","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., 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":"9","key":"28_CR28","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1109\/TC.2009.64","volume":"58","author":"C. Shu","year":"2009","unstructured":"Shu, C., Kwon, S., Gaj, K.: Reconfigurable computing approach for Tate pairing cryptosystems over binary fields. IEEE Transactions on Computers\u00a058(9), 1221\u20131237 (2009)","journal-title":"IEEE Transactions on Computers"},{"key":"28_CR29","unstructured":"Vercauteren, F.: Optimal pairings. Cryptology ePrint Archive, Report 2008\/096 (2008)"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10433-6_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T12:53:50Z","timestamp":1685192030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10433-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642104329","9783642104336"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10433-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}