{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:14:10Z","timestamp":1725725650942},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385520"},{"type":"electronic","value":"9783642385537"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38553-7_2","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T20:47:12Z","timestamp":1368046032000},"page":"26-42","source":"Crossref","is-referenced-by-count":6,"title":["GPU-Based Implementation of 128-Bit Secure Eta Pairing over a Binary Field"],"prefix":"10.1007","author":[{"given":"Utsab","family":"Bose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anup Kumar","family":"Bhattacharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhijit","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-35999-6_12","volume-title":"Selected Areas in Cryptography","author":"J. Adikari","year":"2013","unstructured":"Adikari, J., Hasan, M.A., Negre, C.: Towards faster and greener cryptoprocessor for eta pairing on supersingular elliptic curve over \n                  \n                    \n                  \n                  ${\\rm I\\!F}_{2^{1223}}$\n                . In: Knudsen, L.R., Wu, H. (eds.) SAC 2012. LNCS, vol.\u00a07707, pp. 166\u2013183. Springer, Heidelberg (2013)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-27954-6_7","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"D.F. Aranha","year":"2012","unstructured":"Aranha, D.F., Beuchat, J.-L., Detrey, J., Estibals, N.: Optimal eta pairing on supersingular genus-2 binary hyperelliptic curves. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol.\u00a07178, pp. 98\u2013115. Springer, Heidelberg (2012)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-11925-5_7","volume-title":"Topics in Cryptology - CT-RSA 2010","author":"D.F. Aranha","year":"2010","unstructured":"Aranha, D.F., L\u00f3pez, J., Hankerson, D.: High-speed parallel software implementation of the \u03b7\n                \n                  T\n                 pairing. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol.\u00a05985, pp. 89\u2013105. Springer, Heidelberg (2010)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Barreto, P.S.L.M., Galbraith, S., h\u00c9igeartaigh, C.O., Scott, M.: Efficient pairing computation on supersingular Abelian varieties. Designs, Codes and Cryptography, 239\u2013271 (2004)","DOI":"10.1007\/s10623-006-9033-6"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-10433-6_28","volume-title":"Cryptology and Network Security","author":"J.-L. Beuchat","year":"2009","unstructured":"Beuchat, J.-L., L\u00f3pez-Trejo, E., Mart\u00ednez-Ramos, L., Mitsunari, S., Rodr\u00edguez-Henr\u00edquez, F.: Multi-core implementation of the tate pairing over supersingular elliptic curves. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol.\u00a05888, pp. 413\u2013432. Springer, Heidelberg (2009)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Blake, I., Seroussi, G., Smart, N.: Elliptic curves in cryptography. London Mathematical Society, vol.\u00a0265. Cambridge University Press (1999)","DOI":"10.1017\/CBO9781107360211"},{"issue":"5","key":"2_CR7","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1109\/TC.2011.78","volume":"61","author":"J. Fan","year":"2012","unstructured":"Fan, J., Vercauteren, F., Verbauwhede, I.: Efficient hardware implementation of \n                  \n                    \n                  \n                  ${\\rm I\\!F}_p$\n                -arithmetic for pairing-friendly curves. IEEE Transactions on Computers\u00a061(5), 676\u2013685 (2012)","journal-title":"IEEE Transactions on Computers"},{"key":"2_CR8","first-page":"407","volume":"40","author":"W.W.L. Fung","year":"2007","unstructured":"Fung, W.W.L., Sham, I., Yuan, G., Aamodt, T.M.: Dynamic warp formation and scheduling for efficient GPU control flow. Micro\u00a040, 407\u2013420 (2007)","journal-title":"Micro"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-642-23951-9_29","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"S. Ghosh","year":"2011","unstructured":"Ghosh, S., Roychowdhury, D., Das, A.: High speed cryptoprocessor for \u03b7\n                \n                  T\n                 pairing on 128-bit secure supersingular elliptic curves over characteristic two fields. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol.\u00a06917, pp. 442\u2013458. Springer, Heidelberg (2011)"},{"key":"2_CR10","unstructured":"Glaskowsky, P.: NVIDIA\u2019s Fermi: The first complete GPU computing architecture. White paper, NVIDIA Corporation (2009)"},{"key":"2_CR11","unstructured":"Hankerson, D., Menezes, A., Scott, M.: Software implementation of pairings. In: Cryptology and Information Security Series, vol.\u00a02, pp. 188\u2013206. IOS Press (2009)"},{"key":"2_CR12","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to elliptic curve cryptography. Springer (2004)"},{"key":"2_CR13","unstructured":"Joux, A.: A new index calculus algorithm with complexity L(1\/4\u2009+\u2009o(1)) in very small characteristic. Cryptology ePrint Archive, Report 2013\/095 (2013), \n                  \n                    http:\/\/eprint.iacr.org\/2013\/095"},{"key":"2_CR14","first-page":"293","volume":"145","author":"A. Karatsuba","year":"1962","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of many-digital numbers by automatic computers. Doklady Akad. Nauk. SSSR\u00a0145, 293\u2013294 (1962)","journal-title":"Doklady Akad. Nauk. SSSR"},{"key":"2_CR15","unstructured":"Katoh, Y., Huang, Y.-J., Cheng, C.-M., Takagi, T.: Efficient implementation of the \u03b7\n                \n                  T\n                 pairing on GPU. Cryptology ePrint Archive, Report 2011\/540 (2011), \n                  \n                    http:\/\/eprint.iacr.org\/2011\/540"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 f2m. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol.\u00a01977, pp. 203\u2013212. Springer, Heidelberg (2000)"},{"key":"2_CR17","unstructured":"NVIDIA Corporation, CUDA: Compute unified device architecture programming guide. Technical Report, NVIDIA (2007)"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-03298-1_6","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"M. Scott","year":"2009","unstructured":"Scott, M., Benger, N., Charlemagne, M., Dominguez Perez, L.J., Kachisa, E.J.: On the final exponentiation for calculating pairings on ordinary elliptic curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 78\u201388. Springer, Heidelberg (2009)"},{"key":"2_CR19","unstructured":"Shinohara, N., Shimoyama, T., Hayashi, T., Takagi, T.: Key length estimation of pairing-based cryptosystems using \u03b7\n                \n                  T\n                 pairing. Cryptology ePrint Archive, Report 2012\/042 (2012), \n                  \n                    http:\/\/eprint.iacr.org\/2012\/042"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38553-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T19:44:16Z","timestamp":1557690256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38553-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385520","9783642385537"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38553-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}