{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:49:49Z","timestamp":1725536989870},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041372"},{"type":"electronic","value":"9783642041389"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04138-9_17","type":"book-chapter","created":{"date-parts":[[2009,8,28]],"date-time":"2009-08-28T08:28:34Z","timestamp":1251448114000},"page":"225-239","source":"Crossref","is-referenced-by-count":6,"title":["Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers"],"prefix":"10.1007","author":[{"given":"Jean-Luc","family":"Beuchat","sequence":"first","affiliation":[]},{"given":"J\u00e9r\u00e9mie","family":"Detrey","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Estibals","sequence":"additional","affiliation":[]},{"given":"Eiji","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Rodr\u00edguez-Henr\u00edquez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"Proceedings of the Fourth International Conference on Information Technology: New Generations (ITNG 2008)","author":"A. Barenghi","year":"2008","unstructured":"Barenghi, A., Bertoni, G., Breveglieri, L., Pelosi, G.: A FPGA coprocessor for the cryptographic Tate pairing over $\\mathbb{F}_p$ . In: Proceedings of the Fourth International Conference on Information Technology: New Generations (ITNG 2008). IEEE Computer Society Press, Los Alamitos (2008)"},{"key":"17_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":"17_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":"17_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":"17_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":"17_CR6","volume-title":"Proceedings of the Third International Conference on Information Technology: New Generations (ITNG 2006)","author":"G. Bertoni","year":"2006","unstructured":"Bertoni, G., Breveglieri, L., Fragneto, P., Pelosi, G.: Parallel hardware architectures for the cryptographic Tate pairing. In: Proceedings of the Third International Conference on Information Technology: New Generations (ITNG 2006). IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"17_CR7","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":"17_CR8","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":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-73074-3_4","volume-title":"Arithmetic of Finite Fields","author":"J.-L. Beuchat","year":"2007","unstructured":"Beuchat, J.-L., Brisebarre, N., Shirase, M., Takagi, T., Okamoto, E.: A coprocessor for the final exponentiation of the \u03b7 T pairing in characteristic three. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol.\u00a04547, pp. 25\u201339. Springer, Heidelberg (2007)"},{"key":"17_CR10","unstructured":"Beuchat, J.-L., Doi, H., Fujita, K., Inomata, A., Ith, P., Kanaoka, A., Katouno, M., Mambo, M., Okamoto, E., Okamoto, T., Shiga, T., Shirase, M., Soga, R., Takagi, T., Vithanage, A., Yamamoto, H.: FPGA and ASIC implementations of the \u03b7 T pairing in characteristic three. In: Computers and Electrical Engineering (to appear)"},{"key":"17_CR11","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.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11535218_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 258\u2013275. Springer, Heidelberg (2005)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 y2\u2009=\u2009x p \u2009\u2212\u2009x\u2009+\u2009d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 111\u2013123. Springer, Heidelberg (2003)"},{"key":"17_CR15","unstructured":"Fan, H., Sun, J., Gu, M., Lam, K.-Y.: Overlap-free Karatsuba-Ofman polynomial multiplication algorithm. Cryptology ePrint Archive, Report 2007\/393 (2007)"},{"issue":"206","key":"17_CR16","first-page":"865","volume":"62","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.-G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics of Computation\u00a062(206), 865\u2013874 (1994)","journal-title":"Mathematics of Computation"},{"key":"17_CR17","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":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-77360-3_12","volume-title":"Selected Areas in Cryptography","author":"E. Gorla","year":"2007","unstructured":"Gorla, E., Puttmann, C., Shokrollahi, J.: Explicit formulas for efficient multiplication in $\\mathbb{F}_{3^{6m}}$ . In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol.\u00a04876, pp. 173\u2013183. Springer, Heidelberg (2007)"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11545262_29","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"P. Grabher","year":"2005","unstructured":"Grabher, P., Page, D.: Hardware acceleration of the Tate pairing in characteristic three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 398\u2013411. Springer, Heidelberg (2005)"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/11792086_34","volume-title":"Algorithmic Number Theory","author":"R. Granger","year":"2006","unstructured":"Granger, R., Page, D., Smart, N.P.: High security pairing-based cryptography revisited. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 480\u2013494. Springer, Heidelberg (2006)"},{"key":"17_CR21","series-title":"Cryptology and Information Security Series","first-page":"188","volume-title":"Software Implementation of Pairings, ch. 12","author":"D. Hankerson","year":"2009","unstructured":"Hankerson, D., Menezes, A., Scott, M.: Identity-Based Cryptography. In: Software Implementation of Pairings, ch. 12. Cryptology and Information Security Series, pp. 188\u2013206. IOS Press, Amsterdam (2009)"},{"issue":"3","key":"17_CR22","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.jsc.2003.03.001","volume":"37","author":"G. Hanrot","year":"2004","unstructured":"Hanrot, G., Zimmermann, P.: A long note on Mulders\u2019 short product. Journal of Symbolic Computation\u00a037(3), 391\u2013401 (2004)","journal-title":"Journal of Symbolic Computation"},{"key":"17_CR23","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":"17_CR24","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":"17_CR25","unstructured":"Jiang, J.: Bilinear pairing (Eta_T Pairing) IP core. Technical report, City University of Hong Kong \u2013 Department of Computer Science (May 2007)"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Algorithmic Number Theory","author":"A. Joux","year":"2000","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 385\u2013394. Springer, Heidelberg (2000)"},{"key":"17_CR27","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":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/11802839_44","volume-title":"Reconfigurable Computing: Architectures and Applications","author":"M. Keller","year":"2006","unstructured":"Keller, M., Kerins, T., Crowe, F., Marnane, W.P.: FPGA implementation of a GF(2 m ) Tate pairing architecture. In: Bertels, K., Cardoso, J.M.P., Vassiliadis, S. (eds.) ARC 2006. LNCS, vol.\u00a03985, pp. 358\u2013369. Springer, Heidelberg (2006)"},{"issue":"5\u20136","key":"17_CR29","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.compeleceng.2007.05.002","volume":"33","author":"M. Keller","year":"2007","unstructured":"Keller, M., Ronan, R., Marnane, W.P., Murphy, C.: Hardware architectures for the Tate pairing over GF(2 m ). Computers and Electrical Engineering\u00a033(5\u20136), 392\u2013406 (2007)","journal-title":"Computers and Electrical Engineering"},{"key":"17_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/11545262_30","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"T. Kerins","year":"2005","unstructured":"Kerins, T., Marnane, W.P., Popovici, E.M., Barreto, P.S.L.M.: Efficient hardware for the Tate pairing calculation in characteristic three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 412\u2013426. Springer, Heidelberg (2005)"},{"key":"17_CR31","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)"},{"key":"17_CR32","first-page":"23","volume-title":"Proceedings of the Third International Conference on Systems \u2013 ICONS 2008","author":"G. K\u00f6m\u00fcrc\u00fc","year":"2008","unstructured":"K\u00f6m\u00fcrc\u00fc, G., Sava\u015f, E.: An efficient hardware implementation of the Tate pairing in characteristic three. In: Prasolova-F\u00f8rland, E., Popescu, M. (eds.) Proceedings of the Third International Conference on Systems \u2013 ICONS 2008, pp. 23\u201328. IEEE Computer Society Press, Los Alamitos (2008)"},{"key":"17_CR33","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1016\/j.sysarc.2008.04.012","volume":"54","author":"H. Li","year":"2008","unstructured":"Li, H., Huang, J., Sweany, P., Huang, D.: FPGA implementations of elliptic curve cryptography and Tate pairing over a binary field. Journal of Systems Architecture\u00a054, 1077\u20131088 (2008)","journal-title":"Journal of Systems Architecture"},{"issue":"5","key":"17_CR34","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A. Menezes","year":"1993","unstructured":"Menezes, A., Okamoto, T., Vanstone, S.A.: Reducing elliptic curves logarithms to logarithms in a finite field. IEEE Transactions on Information Theory\u00a039(5), 1639\u20131646 (1993)","journal-title":"IEEE Transactions on Information Theory"},{"key":"17_CR35","unstructured":"Miller, V.S.: Short programs for functions on curves (1986), http:\/\/crypto.stanford.edu\/miller"},{"issue":"4","key":"17_CR36","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":"17_CR37","unstructured":"Mitsunari, S.: A fast implementation of \u03b7 T pairing in characteristic three on Intel Core 2 Duo processor. Cryptology ePrint Archive, Report 2009\/032 (2009)"},{"issue":"2","key":"17_CR38","first-page":"481","volume":"E85\u2013A","author":"S. Mitsunari","year":"2002","unstructured":"Mitsunari, S., Sakai, R., Kasahara, M.: A new traitor tracing. IEICE Trans. Fundamentals\u00a0E85\u2013A(2), 481\u2013484 (2002)","journal-title":"IEICE Trans. Fundamentals"},{"issue":"2","key":"17_CR39","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1504\/IJHPSA.2007.015393","volume":"1","author":"R. Ronan","year":"2007","unstructured":"Ronan, R., Murphy, C., Kerins, T., \u00d3h\u00c9igeartaigh, C., Barreto, P.S.L.M.: A flexible processor for the characteristic 3 \u03b7 T pairing. Int. J. High Performance Systems Architecture\u00a01(2), 79\u201388 (2007)","journal-title":"Int. J. High Performance Systems Architecture"},{"key":"17_CR40","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/FPT.2006.270314","volume-title":"Proceedings of the IEEE International Conference on Field Programmable Technology \u2013 FPT 2006","author":"R. Ronan","year":"2006","unstructured":"Ronan, R., \u00d3h\u00c9igeartaigh, C., Murphy, C., Scott, M., Kerins, T.: FPGA acceleration of the Tate pairing in characteristic 2. In: Proceedings of the IEEE International Conference on Field Programmable Technology \u2013 FPT 2006, pp. 213\u2013220. IEEE, Los Alamitos (2006)"},{"key":"17_CR41","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.sysarc.2006.09.003","volume":"53","author":"R. Ronan","year":"2007","unstructured":"Ronan, R., \u00d3h\u00c9igeartaigh, C., Murphy, C., Scott, M., Kerins, T.: Hardware acceleration of the Tate pairing on a genus 2 hyperelliptic curve. Journal of Systems Architecture\u00a053, 85\u201398 (2007)","journal-title":"Journal of Systems Architecture"},{"key":"17_CR42","unstructured":"Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: 2000 Symposium on Cryptography and Information Security (SCIS 2000), Okinawa, Japan, January 2000, pp. 26\u201328 (2000)"},{"key":"17_CR43","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1109\/FPT.2006.270309","volume-title":"Proceedings of the IEEE International Conference on Field Programmable Technology \u2013 FPT 2006","author":"C. Shu","year":"2006","unstructured":"Shu, C., Kwon, S., Gaj, K.: FPGA accelerated Tate pairing based cryptosystem over binary fields. In: Proceedings of the IEEE International Conference on Field Programmable Technology \u2013 FPT 2006, pp. 173\u2013180. IEEE, Los Alamitos (2006)"},{"issue":"2","key":"17_CR44","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1008013818413","volume":"19","author":"L. Song","year":"1998","unstructured":"Song, L., Parhi, K.K.: Low energy digit-serial\/parallel finite field multipliers. Journal of VLSI Signal Processing\u00a019(2), 149\u2013166 (1998)","journal-title":"Journal of VLSI Signal Processing"},{"key":"17_CR45","unstructured":"Vercauteren, F.: Optimal pairings. Cryptology ePrint Archive, Report 2008\/096 (2008)"},{"key":"17_CR46","doi-asserted-by":"publisher","DOI":"10.1201\/9781420071474","volume-title":"Elliptic Curves \u2013 Number Theory and Cryptography","author":"L.C. Washington","year":"2008","unstructured":"Washington, L.C.: Elliptic Curves \u2013 Number Theory and Cryptography, 2nd edn. CRC Press, Boca Raton (2008)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems - CHES 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04138-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T03:47:45Z","timestamp":1558496865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04138-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041372","9783642041389"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04138-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}