{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:30:41Z","timestamp":1743143441460,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642359989"},{"type":"electronic","value":"9783642359996"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35999-6_12","type":"book-chapter","created":{"date-parts":[[2013,1,2]],"date-time":"2013-01-02T01:51:55Z","timestamp":1357091515000},"page":"166-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\\mathbb{F}_{2^{1223}}$"],"prefix":"10.1007","author":[{"given":"Jithra","family":"Adikari","sequence":"first","affiliation":[]},{"given":"M. Anwar","family":"Hasan","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Negre","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","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)"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/TC.2010.163","volume":"60","author":"J.-L. Beuchat","year":"2011","unstructured":"Beuchat, J.-L., Detrey, J., Estibals, N., Okamoto, E., Rodr\u00edguez-Henr\u00edquez, F.: Fast Architectures for the \u03b7\n                  \n                    T\n                   Pairing over Small-Characteristic Supersingular Elliptic Curves. IEEE Transactions on Computers\u00a060(2), 266\u2013281 (2011)","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.K.: Identity-Based Encryption from the Weil Pairing. SIAM Journal on Computing\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"12_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. Journal of Cryptology\u00a017(4), 297\u2013319 (2004)","journal-title":"Journal of Cryptology"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Canright, D.: A very compact Rijndael S-box. Technical Report NPS-MA-04-001, Naval Postgraduate School (2004)","DOI":"10.21236\/ADA434781"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-23951-9_28","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"R.C.C. Cheung","year":"2011","unstructured":"Cheung, R.C.C., Duquesne, S., Fan, J., Guillermin, N., Verbauwhede, I., Yao, G.X.: FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol.\u00a06917, pp. 421\u2013441. Springer, Heidelberg (2011)"},{"key":"12_CR7","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)"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/TC.2007.19","volume":"56","author":"H. Fan","year":"2007","unstructured":"Fan, H., Hasan, M.A.: A New Approach to Sub-quadratic Space Complexity Parallel Multipliers for Extended Binary Fields. IEEE Transactions on Computers\u00a056(2), 224\u2013233 (2007)","journal-title":"IEEE Transactions on Computers"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1049\/iet-ifs.2009.0039","volume":"4","author":"H. Fan","year":"2010","unstructured":"Fan, H., Sun, J., Gu, M., Lam, K.-Y.: Overlap-free Karatsuba-Ofman polynomial multiplication algorithms. Information Security, IET\u00a04, 8\u201314 (2010)","journal-title":"Information Security, IET"},{"key":"12_CR10","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)"},{"issue":"5","key":"12_CR11","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 $\\mathbb{F}_p$-Arithmetic for Pairing-Friendly Curves. IEEE Transactions on Computers\u00a061(5), 676\u2013685 (2012)","journal-title":"IEEE Transactions on Computers"},{"key":"12_CR12","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":"12_CR13","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)"},{"issue":"3","key":"12_CR14","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\n                    m\n                  ) Using Normal Bases. Inf. Comput.\u00a078(3), 171\u2013177 (1988)","journal-title":"Inf. Comput."},{"key":"12_CR15","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)"},{"key":"12_CR16","unstructured":"Mastrovito, E.D.: VLSI Architectures for Computation in Galois Fields. PhD thesis, Linkoping University, Department of Electrical Engineering, Linkoping, Sweden (1991)"},{"issue":"3","key":"12_CR17","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. Designs, Codes and Cryptography\u00a042(3), 239\u2013271 (2007)","journal-title":"Designs, Codes and Cryptography"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1109\/TC.2004.52","volume":"53","author":"B. Sunar","year":"2004","unstructured":"Sunar, B.: A Generalized Method for Constructing Subquadratic Complexity GF(2\n                    k\n                  ) Multipliers. IEEE Transactions on Computers\u00a053, 1097\u20131105 (2004)","journal-title":"IEEE Transactions on Computers"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Winograd, S.: Arithmetic Complexity of Computations. Society For Industrial & Applied Mathematics, U.S. (1980)","DOI":"10.1137\/1.9781611970364"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35999-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:27:15Z","timestamp":1630456035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-35999-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642359989","9783642359996"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35999-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}