{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:13:41Z","timestamp":1725614021975},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642239502"},{"type":"electronic","value":"9783642239519"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23951-9_29","type":"book-chapter","created":{"date-parts":[[2011,9,26]],"date-time":"2011-09-26T05:17:11Z","timestamp":1317014231000},"page":"442-458","source":"Crossref","is-referenced-by-count":10,"title":["High Speed Cryptoprocessor for \u03b7 T Pairing on 128-bit Secure Supersingular Elliptic Curves over Characteristic Two Fields"],"prefix":"10.1007","author":[{"given":"Santosh","family":"Ghosh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dipanwita","family":"Roychowdhury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhijit","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Aranha, D.F., Beuchat, J.L., Detrey, J., Estibals, N.: Optimal Eta pairing on supersingular genus-2 binary hyperelliptic curves. Cryptology ePrint Archive, Report 2010\/559, http:\/\/eprint.iacr.org\/"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Barke, E., Barker, W., Burr, W., Polk, W., Smid, M.: Recommendation for key management part 1: General (revised). National Institute of Standards and Technology, NIST Special Publication 800-57 (2007)","DOI":"10.6028\/NIST.SP.800-57p1r2007"},{"key":"29_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. Designs, Codes and Cryptography\u00a042, 239\u2013271 (2007)","journal-title":"Designs, Codes and Cryptography"},{"key":"29_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. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Beuchat, J.L., Detrey, J., Estibals, N., Okamoto, E., Henr\u00edguez, F.R.: Fast architectures for the \u03b7 T pairing over small-characteristic supersingular elliptic curves. IEEE Transactions on Computers\u00a060(2) (2011)","DOI":"10.1109\/TC.2010.163"},{"key":"29_CR6","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":"29_CR7","doi-asserted-by":"crossref","unstructured":"Beuchat, J.L., Trejo, E.L., Ramos, L.M., Mitsunari, S., Henr\u00edquez, F.R.: Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves. Cryptology ePrint Archive, Report 2009\/276 (2009), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-10433-6_28"},{"key":"29_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":"29_CR9","unstructured":"Duquesne, S., Guillermin, N.: A FPGA pairing implementation using the residue number system. Cryptology ePrint Archive, Report 2011\/176 (2011), http:\/\/eprint.iacr.org\/"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-17455-1_25","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"N. Estibals","year":"2010","unstructured":"Estibals, N.: Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 397\u2013416. Springer, Heidelberg (2010)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Fan, J., Vercauteren, F., Verbauwhede, I.: Efficient Hardware Implementation of $\\mathbb{F}_{p}$ -arithmetic for Pairing-Friendly Curves. IEEE Trasaction on Computers (to appear, 2011)","DOI":"10.1109\/TC.2011.78"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-04138-9_18","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2009","author":"J. Fan","year":"2009","unstructured":"Fan, J., Vercauteren, F., Verbauwhede, I.: Faster $\\mathbb{F}_p$ -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol.\u00a05747, pp. 240\u2013253. Springer, Heidelberg (2009)"},{"key":"29_CR13","series-title":"London Mathematical Society Lecture Note Series","volume-title":"Advances in Elliptic Curve Cryptography","author":"S. Galbraith","year":"2005","unstructured":"Galbraith, S.: Pairings. In: Blake, I.F., Seroussi, G., Smart, N.P. (eds.) Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Note Series, vol.\u00a0ch. IX, Cambridge University Press, Cambridge (2005)"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-642-17455-1_28","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"S. Ghosh","year":"2010","unstructured":"Ghosh, S., Mukhopadhyay, D., Roychowdhury, D.: High speed flexible pairing cryptoprocessor on FPGA platform. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 450\u2013466. Springer, Heidelberg (2010)"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-04159-4_3","volume-title":"Selected Areas in Cryptography","author":"P. Grabher","year":"2009","unstructured":"Grabher, P., Gro\u00dfsch\u00e4dl, J., Page, D.: On software parallel implementation of cryptographic pairings. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol.\u00a05381, pp. 35\u201350. Springer, Heidelberg (2009)"},{"key":"29_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. 12, pp. 188\u2013206. IOS Press, Amsterdam (2009)"},{"key":"29_CR17","unstructured":"Henr\u00edquez, F.R., Ko\u00e7, \u00c7.K.: On fully parallel Karatsuba multipliers for GF(2 m ). In: International Conference on Computer Science and Technology CST 2003, pp. 405\u2013410 (2003)"},{"issue":"10","key":"29_CR18","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":"29_CR19","volume-title":"An introduction to mathematical cryptography","author":"J. Hoffstein","year":"2008","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: An introduction to mathematical cryptography. Springer, Heidelberg (2008)"},{"issue":"3","key":"29_CR20","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T. Itoh","year":"1988","unstructured":"Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in GF(2 m ) using normal bases. Inf. Comput.\u00a078(3), 171\u2013177 (1988)","journal-title":"Inf. Comput."},{"key":"29_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-04138-9_19","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2009","author":"D. Kammler","year":"2009","unstructured":"Kammler, D., Zhang, D., Schwabe, P., Scharwaechter, H., Langenberg, M., Auras, D., Ascheid, G., Mathar, R.: Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol.\u00a05747, pp. 254\u2013271. Springer, Heidelberg (2009)"},{"issue":"7","key":"29_CR22","first-page":"595","volume":"7","author":"A. Karatsuba","year":"1963","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of Multidigit Numbers on Automata. Soviet Physics Doklady (English Translation)\u00a07(7), 595\u2013596 (1963)","journal-title":"Soviet Physics Doklady (English Translation)"},{"key":"29_CR23","unstructured":"Lee, E., Lee, H.S., Park, C.M.: Efficient and generalized pairing computation on abelian varieties. Cryptology ePrint Archive, Report 2009\/040 (2009), http:\/\/eprint.iacr.org\/"},{"key":"29_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45682-1_5","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"A. Lenstra","year":"2001","unstructured":"Lenstra, A.: Unbelievable security: Matching AES security using public key systems. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 67\u201386. Springer, Heidelberg (2001)"},{"key":"29_CR25","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":"29_CR26","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Niederhagen, R., Schwabe, P.: New software speed records for cryptographic pairings. Cryptology ePrint Archive, Report 2010\/186, http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-14712-8_7"},{"key":"29_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-540-89754-5_29","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"C. Rebeiro","year":"2008","unstructured":"Rebeiro, C., Mukhopadhyay, D.: High speed compact elliptic curve cryptoprocessor for FPGA platforms. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol.\u00a05365, pp. 376\u2013388. Springer, Heidelberg (2008)"},{"issue":"9","key":"29_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":"29_CR29","unstructured":"Weimerskirch, A., Paar, C.: Generalizations of the Karatsuba algorithm for efficient implementations. Cryptology ePrint Archive, Report 2006\/224 (2006), http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems \u2013 CHES 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23951-9_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:15:03Z","timestamp":1606187703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23951-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642239502","9783642239519"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23951-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}