{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T01:33:08Z","timestamp":1725672788582},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642291005"},{"type":"electronic","value":"9783642291012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29101-2_16","type":"book-chapter","created":{"date-parts":[[2012,4,2]],"date-time":"2012-04-02T04:10:23Z","timestamp":1333339823000},"page":"228-244","source":"Crossref","is-referenced-by-count":7,"title":["Key Length Estimation of Pairing-Based Cryptosystems Using \u03b7 T Pairing"],"prefix":"10.1007","author":[{"given":"Naoyuki","family":"Shinohara","sequence":"first","affiliation":[]},{"given":"Takeshi","family":"Shimoyama","sequence":"additional","affiliation":[]},{"given":"Takuya","family":"Hayashi","sequence":"additional","affiliation":[]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-58691-1_48","volume-title":"Algorithmic Number Theory","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":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-540-75651-4_5","volume-title":"Advances in Information and Computer Security","author":"K. Aoki","year":"2007","unstructured":"Aoki, K., Shimoyama, T., Ueda, H.: Experiments on the Linear Algebra Step in the Number Field Sieve. In: Miyaji, A., Kikuchi, H., Rannenberg, K. (eds.) IWSEC 2007. LNCS, vol.\u00a04752, pp. 58\u201373. Springer, Heidelberg (2007)"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1006\/inco.1998.2761","volume":"151","author":"L.M. Adleman","year":"1999","unstructured":"Adleman, L.M., Huang, M.-D.A.: Function field sieve method for discrete logarithms over finite fields. Inform. and Comput.\u00a0151, 5\u201316 (1999)","journal-title":"Inform. and Comput."},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-73074-3_8","volume-title":"Arithmetic of Finite Fields","author":"O. Ahmadi","year":"2007","unstructured":"Ahmadi, O., Hankerson, D., Menezes, A.: Software Implementation of Arithmetic in \n                    \n                      \n                    \n                    $F_{3^m}$\n                  . In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol.\u00a04547, pp. 85\u2013102. Springer, Heidelberg (2007)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Barker, E., Barker, W., Burr, W., Polk, W., Smid, M.: Recommendation for key management - Part 1: General (Revised). NIST Special Publication 800-57 (2007)","DOI":"10.6028\/NIST.SP.800-57p1r2007"},{"key":"16_CR6","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)"},{"issue":"3","key":"16_CR7","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., \u00d3h\u00c9igeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Des., Codes Cryptogr.\u00a042(3), 239\u2013271 (2007)","journal-title":"Des., Codes Cryptogr."},{"issue":"11","key":"16_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\n                  \n                    T\n                   pairing in characteristic three. IEEE Trans. Comput.\u00a057(11), 1454\u20131468 (2008)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity based encryption from the Weil pairing. SIAM J. Comput.\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM J. Comput."},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/10722028_11","volume-title":"Algorithmic Number Theory","author":"S. Cavallar","year":"2000","unstructured":"Cavallar, S.: Strategies in Filtering in the Number Field Sieve. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 209\u2013231. Springer, Heidelberg (2000)"},{"key":"16_CR11","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. Galbraith","year":"2002","unstructured":"Galbraith, S., 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":"16_CR12","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 \n                    \n                      \n                    \n                    $F_{3^{6m}}$\n                  . In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol.\u00a04876, pp. 173\u2013183. Springer, Heidelberg (2007)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-540-40974-8_16","volume-title":"Cryptography and Coding","author":"R. Granger","year":"2003","unstructured":"Granger, R.: Estimates for Discrete Logarithm Computations in Finite Fields of Small Characteristic. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol.\u00a02898, pp. 190\u2013206. Springer, Heidelberg (2003)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24847-7_16","volume-title":"Algorithmic Number Theory","author":"R. Granger","year":"2004","unstructured":"Granger, R., Holt, A.J., Page, D., Smart, N.P., Vercauteren, F.: Function Field Sieve in Characteristic Three. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol.\u00a03076, pp. 223\u2013234. Springer, Heidelberg (2004)"},{"issue":"7","key":"16_CR15","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1109\/TC.2005.120","volume":"54","author":"R. Granger","year":"2005","unstructured":"Granger, R., Page, D., Stam, M.: Hardware and software normal basis arithmetic for pairing-based cryptography in characteristic three. IEEE Trans. Comput.\u00a054(7), 852\u2013860 (2005)","journal-title":"IEEE Trans. Comput."},{"key":"16_CR16","unstructured":"Hankerson, D., Menezes, A., Scott, M.: Software implementation of pairings. In: Identity-Based Cryptography, pp. 188\u2013206 (2009)"},{"key":"16_CR17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1112\/S1461157000000747","volume":"5","author":"K. Harrison","year":"2002","unstructured":"Harrison, K., Page, D., Smart, N.P.: Software implementation of finite fields of characteristic three, for use in pairing-based cryptosystems. LMS Journal of Computation and Mathematics\u00a05, 181\u2013193 (2002)","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-642-13013-7_21","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"T. Hayashi","year":"2010","unstructured":"Hayashi, T., Shinohara, N., Wang, L., Matsuo, S., Shirase, M., Takagi, T.: Solving a 676-Bit Discrete Logarithm Problem in GF(36n\n                  ). In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 351\u2013367. Springer, Heidelberg (2010)"},{"key":"16_CR19","unstructured":"Joux, A., et al.: Discrete logarithms in GF(2607) and GF(2613). Posting to the Number Theory List (2005), \n                    \n                      http:\/\/listserv.nodak.edu\/cgi-bin\/wa.exe?A2=ind0509&L=nmbrthry&T=0&P=3690"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45455-1_34","volume-title":"Algorithmic Number Theory","author":"A. Joux","year":"2002","unstructured":"Joux, A., Lercier, R.: The Function Field Sieve Is Quite Special. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 431\u2013445. Springer, Heidelberg (2002)"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/11761679_16","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"A. Joux","year":"2006","unstructured":"Joux, A., Lercier, R.: The Function Field Sieve in the Medium Prime Case. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 254\u2013270. Springer, Heidelberg (2006)"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-85538-5_19","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"Y. Kawahara","year":"2008","unstructured":"Kawahara, Y., Aoki, K., Takagi, T.: Faster Implementation of \u03b7\n                  \n                    T\n                   Pairing Over GF(3\n                    m\n                  ) Using Minimum Number of Logical Instructions for GF(3)-Addition. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 282\u2013296. Springer, Heidelberg (2008)"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/978-3-642-14623-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"T. Kleinjung","year":"2010","unstructured":"Kleinjung, T., Aoki, K., Franke, J., Lenstra, A.K., Thom\u00e9, E., Bos, J.W., Gaudry, P., Kruppa, A., Montgomery, P.L., Osvik, D.A., te Riele, H., Timofeev, A., Zimmermann, P.: Factorization of a 768-Bit RSA Modulus. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 333\u2013350. Springer, Heidelberg (2010)"},{"key":"16_CR24","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.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)"},{"issue":"1","key":"16_CR25","doi-asserted-by":"crossref","first-page":"33","DOI":"10.6028\/jres.049.006","volume":"49","author":"C. Lanczos","year":"1952","unstructured":"Lanczos, C.: Solution of systems of linear equations by minimized iterations. J. Res. Nat. Bureau of Standards\u00a049(1), 33\u201353 (1952)","journal-title":"J. Res. Nat. Bureau of Standards"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Manasse, M.S., Pollard, J.M.: The number field sieve. LNIM, vol.\u00a01554, pp. 43\u201349 (1993)","DOI":"10.1007\/BFb0091537"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Pollard, J.M.: The lattice sieve. LNIM, vol.\u00a01554, pp. 43\u201349 (1993)","DOI":"10.1007\/BFb0091538"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/3-540-36400-5_38","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"D. Page","year":"2003","unstructured":"Page, D., Smart, N.P.: Hardware Implementation of Finite Fields of Characteristic Three. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 529\u2013539. Springer, Heidelberg (2003)"},{"key":"16_CR29","first-page":"99","volume":"37","author":"C. Pomerance","year":"1983","unstructured":"Pomerance, C., Wagstaff Jr., S.S.: Implementation of the continued fraction integer factoring algorithm. Congress Numer.\u00a037, 99\u2013118 (1983)","journal-title":"Congress Numer."},{"key":"16_CR30","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"},{"key":"16_CR31","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s00200-006-0017-6","volume":"17","author":"N. Smart","year":"2006","unstructured":"Smart, N., Page, D., Vercauteren, F.: A comparison of MNT curves and supersingular curves. Applicable Algebra in Engineering, Communication and Computing\u00a017, 379\u2013392 (2006)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29101-2_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:23:35Z","timestamp":1620127415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29101-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291005","9783642291012"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29101-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}