{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:19:52Z","timestamp":1742379592276},"publisher-location":"Berlin, Heidelberg","reference-count":49,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174544"},{"type":"electronic","value":"9783642174551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17455-1_25","type":"book-chapter","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T15:31:49Z","timestamp":1290007909000},"page":"397-416","source":"Crossref","is-referenced-by-count":20,"title":["Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Estibals","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/3-540-58691-1_48","volume-title":"Algorithmic NNumber Theory Symposium \u2013 ANTS I.","author":"L.M. Adleman","year":"1994","unstructured":"Adleman, L.M.: The function field sieve. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol.\u00a0877, pp. 108\u2013121. Springer, Heidelberg (1994)"},{"key":"25_CR2","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, Los Alamitos (2008)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"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\u2013369. Springer, Heidelberg (2002)"},{"key":"25_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":"2005","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 (2005)"},{"issue":"3","key":"25_CR5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P. Barreto","year":"2007","unstructured":"Barreto, P., Galbraith, S., h\u00c9igeartaigh, C.\u00d3., 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":"25_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 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., Paterson, K. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 297\u2013315. Springer, Heidelberg (2008)"},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.compeleceng.2009.05.001","volume":"36","author":"J.L. Beuchat","year":"2010","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. Computers and Electrical Engineering\u00a036(1), 73\u201387 (2010)","journal-title":"Computers and Electrical Engineering"},{"issue":"11","key":"25_CR8","first-page":"1454","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 \u2013 Special Section on Special-Purpose Hardware for Cryptography and Cryptanalysis\u00a057(11), 1454\u20131468 (2008)","journal-title":"IEEE Transactions on Computers \u2013 Special Section on Special-Purpose Hardware for Cryptography and Cryptanalysis"},{"key":"25_CR9","unstructured":"Beuchat, J.L., Detrey, J., Estibals, N., Okamoto, E., Rodr\u00edguez-Henr\u00edquez, F.: Fast architectures for the \u03b7 T pairing over small-characteristic supersingular elliptic curves (2009), cryptology ePrint Archive, Report 2009\/398"},{"key":"25_CR10","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-Ofman multipliers. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol.\u00a05747, pp. 225\u2013239. Springer, Heidelberg (2009)"},{"key":"25_CR11","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., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol.\u00a05888, pp. 413\u2013432. Springer, Heidelberg (2009)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"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)"},{"issue":"4","key":"25_CR13","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":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-540-68164-9_27","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"M. Cenk","year":"2008","unstructured":"Cenk, M., \u00d6zbudak, F.: Efficient multiplication in $\\mathbb{F}_{3^{\\ell m}}, m \\geq 1$ and 5\u2009\u2264\u2009\u2113\u2009\u2264\u200918. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol.\u00a05023, pp. 406\u2013414. Springer, Heidelberg (2008)"},{"issue":"2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.jco.2009.11.002","volume":"26","author":"M. Cenk","year":"2010","unstructured":"Cenk, M., \u00d6zbudak, F.: On multiplication in finite fields. Journal of Complexity\u00a026(2), 172\u2013186 (2010)","journal-title":"Journal of Complexity"},{"key":"25_CR16","unstructured":"Cesena, E.: Pairing with supersingular Trace Zero Varieties revisited (2008), cryptology ePrint Archive, Report 2008\/404"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Diem, C.: On the discrete logarithm problem in class groups of curves. Mathemathics of Computation (to appear)","DOI":"10.1090\/S0025-5718-2010-02281-1"},{"key":"25_CR18","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":"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. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 111\u2013123. Springer, Heidelberg (2003)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-3-540-48000-6_10","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"I.M. Duursma","year":"1999","unstructured":"Duursma, I.M., Gaudry, P., Morain, F.: Speeding up the discrete log computation on curves with automorphisms. In: Lam, K.Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 103\u2013121. Springer, Heidelberg (1999)"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","first-page":"10","volume-title":"CRYPTO 1985","author":"T. El-Gamal","year":"1984","unstructured":"El-Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1985. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1984)"},{"issue":"5","key":"25_CR21","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TC.2007.1024","volume":"56","author":"H. Fan","year":"2007","unstructured":"Fan, H., Hasan, M.A.: Comments on Montgomery\u2019s \u201dFive, Six, and Seven-Term Karatsuba-Like Formulae\u201d. IEEE Transactions on Computers\u00a056(5), 716\u2013717 (2007)","journal-title":"IEEE Transactions on Computers"},{"key":"25_CR22","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":"25_CR23","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/978-3-642-56755-1_13","volume-title":"Proceedings of the Fifth International Conference on Finite Fields and Applications (Augsburg, 1999)","author":"G. Frey","year":"2001","unstructured":"Frey, G.: Applications of arithmetical geometry to cryptographic constructions. In: Proceedings of the Fifth International Conference on Finite Fields and Applications (Augsburg, 1999), pp. 128\u2013161. Springer, Heidelberg (2001)"},{"issue":"206","key":"25_CR24","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"},{"issue":"232","key":"25_CR25","doi-asserted-by":"crossref","first-page":"1699","DOI":"10.1090\/S0025-5718-99-01119-9","volume":"69","author":"R.P. Gallant","year":"2000","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Improving the parallelized Pollard lambda search on anomalous binary curves. Math. Comput.\u00a069(232), 1699\u20131705 (2000)","journal-title":"Math. Comput."},{"issue":"12","key":"25_CR26","doi-asserted-by":"publisher","first-page":"1690","DOI":"10.1016\/j.jsc.2008.08.005","volume":"44","author":"P. Gaudry","year":"2009","unstructured":"Gaudry, P.: Index calculus for abelian varieties and the elliptic curve discrete logarithm problem. Journal of Symbolic Compution\u00a044(12), 1690\u20131702 (2009)","journal-title":"Journal of Symbolic Compution"},{"issue":"1","key":"25_CR27","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00145-001-0011-x","volume":"15","author":"P. Gaudry","year":"2002","unstructured":"Gaudry, P., Hess, F., Smart, N.: Constructive and destructive facets of Weil descent on elliptic curves. Journal of Cryptology\u00a015(1), 19\u201346 (2002)","journal-title":"Journal of Cryptology"},{"key":"25_CR28","series-title":"Lecture Notes in Computer Science","volume-title":"ASIACRYPT","author":"R. Granger","year":"2010","unstructured":"Granger, R.: On the static Diffie\u2013Hellman problem on elliptic curves over extension fields. In: ASIACRYPT. LNCS, Springer, Heidelberg (2010) (to appear)"},{"issue":"3","key":"25_CR29","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. Information and Computation\u00a078(3), 171\u2013177 (1988)","journal-title":"Information and Computation"},{"key":"25_CR30","unstructured":"Jiang, J.: Bilinear pairing (Eta_T Pairing) IP core. Tech. rep., City University of Hong Kong \u2013 Department of Computer Science (May 2007)"},{"key":"25_CR31","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":"25_CR32","unstructured":"Joux, A., Vitse, V.: Elliptic curve discrete logarithm problem over small degree extension fields. Application to the static Diffie\u2013Hellman problem on ${E}(\\mathbb{F}_{q^5})$ (2010), cryptology ePrint Archive, Report 2010\/157"},{"key":"25_CR33","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":"25_CR34","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., Popovici, E., Barreto, P.: Efficient hardware for the Tate pairing calculation in characteristic three. In: Rao, J., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 412\u2013426. Springer, Heidelberg (2005)"},{"key":"25_CR35","unstructured":"Leyland, P.: Cunningham numbers, http:\/\/www.leyland.vispa.com\/numth\/factorization\/cunningham\/main.htm"},{"issue":"5","key":"25_CR36","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A.J. Menezes","year":"1993","unstructured":"Menezes, A.J., Okamoto, T., Vanstone, S.A.: Reducing elliptic curve 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":"25_CR37","unstructured":"Miller, V.S.: Short programs for functions on curves. IBM, Thomas J. Watson Research Center (1986)"},{"issue":"4","key":"25_CR38","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. J. Cryptology\u00a017(4), 235\u2013261 (2004)","journal-title":"J. Cryptology"},{"issue":"2","key":"25_CR39","first-page":"481","volume":"E85-A","author":"S. Mitsunari","year":"2002","unstructured":"Mitsunari, S., Sakai, R., Kasahara, M.: A new traitor tracing. IEICE Trans. Fundamentals\u00a0E85-A(2), 481\u2013484 (2002)","journal-title":"IEICE Trans. Fundamentals"},{"issue":"3","key":"25_CR40","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/TC.2005.49","volume":"54","author":"P.L. Montgomery","year":"2005","unstructured":"Montgomery, P.L.: Five, six, and seven-term Karatsuba-like formulae. IEEE Transactions on Computers\u00a054(3), 362\u2013369 (2005)","journal-title":"IEEE Transactions on Computers"},{"key":"25_CR41","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Niederhagen, R., Schwabe, P.: New software speed records for cryptographic pairings (2010), cryptology ePrint Archive, Report 2010\/186","DOI":"10.1007\/978-3-642-14712-8_7"},{"key":"25_CR42","doi-asserted-by":"crossref","unstructured":"Pollard, J.: Monte Carlo methods for index computation (mod p). Mathematics of Computation, 918\u2013924 (1978)","DOI":"10.2307\/2006496"},{"key":"25_CR43","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., h\u00c9igeartaigh, C.\u00d3., 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":"25_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-45708-9_22","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"K. Rubin","year":"2002","unstructured":"Rubin, K., Silverberg, A.: Supersingular abelian varieties in cryptology. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 336\u2013353. Springer, Heidelberg (2002)"},{"issue":"3","key":"25_CR45","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/s00145-008-9022-1","volume":"22","author":"K. Rubin","year":"2009","unstructured":"Rubin, K., Silverberg, A.: Using abelian varieties to improve pairing-based cryptography. Journal of Cryptology\u00a022(3), 330\u2013364 (2009)","journal-title":"Journal of Cryptology"},{"key":"25_CR46","unstructured":"Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: 2000 Symposium on Cryptography and Information Security (SCIS 2000), Okinawa, Japan, pp. 26\u201328 (January 2000)"},{"issue":"9","key":"25_CR47","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":"25_CR48","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The Arithmetic of Elliptic Curves","author":"J.H. Silverman","year":"1986","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves. Graduate Texts in Mathematics, vol.\u00a0106. Springer, Heidelberg (1986)"},{"key":"25_CR49","unstructured":"Wagstaff, S.: The Cunningham Project, http:\/\/homes.cerias.purdue.edu\/~ssw\/cun\/index.html"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography - Pairing 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17455-1_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:53:33Z","timestamp":1606186413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17455-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174544","9783642174551"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17455-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}