{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:50:44Z","timestamp":1776844244397,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642130120","type":"print"},{"value":"9783642130137","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13013-7_21","type":"book-chapter","created":{"date-parts":[[2010,5,14]],"date-time":"2010-05-14T02:18:57Z","timestamp":1273803537000},"page":"351-367","source":"Crossref","is-referenced-by-count":13,"title":["Solving a 676-Bit Discrete Logarithm Problem in GF(36n )"],"prefix":"10.1007","author":[{"given":"Takuya","family":"Hayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoyuki","family":"Shinohara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lihua","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin\u2019ichiro","family":"Matsuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaaki","family":"Shirase","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_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 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":"21_CR2","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":"21_CR3","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":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-30539-2_8","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"K. Aoki","year":"2004","unstructured":"Aoki, K., Ueda, H.: Sieving using bucket sort. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 92\u2013102. Springer, Heidelberg (2004)"},{"issue":"3","key":"21_CR5","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":"21_CR6","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."},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Crescenzo, D., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 506\u2013522. Springer, Heidelberg (2004)"},{"issue":"3","key":"21_CR8","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."},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/0406010","volume":"6","author":"D.M. Gordon","year":"1993","unstructured":"Gordon, D.M.: Discrete logarithms in GF(p) using the number field sieve. SIAM J. Discrete Math.\u00a06(1), 124\u2013138 (1993)","journal-title":"SIAM J. Discrete Math."},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/3-540-48071-4_22","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"D.M. Gordon","year":"1993","unstructured":"Gordon, D.M., McCurley, K.S.: Massively parallel computation of discrete logarithms. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 312\u2013323. Springer, Heidelberg (1993)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"21_CR13","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":"21_CR14","unstructured":"Hankerson, D., Menezes, A., Scott, M.: Software implementation of pairings. In: Identity Based Cryptography, pp. 188\u2013206 (2009)"},{"key":"21_CR15","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":"21_CR16","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)"},{"issue":"242","key":"21_CR17","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1090\/S0025-5718-02-01482-5","volume":"72","author":"A. Joux","year":"2002","unstructured":"Joux, A., Lercier, R.: Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the Gaussian integer method. Math. Comp.\u00a072(242), 953\u2013967 (2002)","journal-title":"Math. Comp."},{"key":"21_CR18","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":"21_CR19","doi-asserted-by":"crossref","unstructured":"Joux, A., Lercier, R., Naccache, D., Thome, E.: Oracle-assisted static Diffie-Hellman is easier than discrete logarithms. In: Parker, M.G. (ed.) IMACC 2009. LNCS, vol.\u00a05921, pp. 351\u2013367. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-10868-6_21"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/11818175_19","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"A. Joux","year":"2006","unstructured":"Joux, A., Lercier, R., Smart, N.P., Vercauteren, F.: The number field sieve in the medium prime case. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 326\u2013344. Springer, Heidelberg (2006)"},{"key":"21_CR21","unstructured":"Kleinjung, T., et al.: Discrete logarithms in GF(p) - 160 digits. Posting to the Number Theory List (2007), \n                    \n                      http:\/\/listserv.nodak.edu\/cgi-bin\/wa.exe?A2=ind0702&L=nmbrthry&T=0&P=194"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3-540-38424-3_8","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"B.A. LaMacchia","year":"1991","unstructured":"LaMacchia, B.A., Odlyzko, A.M.: Solving large sparse linear systems over finite fields. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 109\u2013133. Springer, Heidelberg (1991)"},{"key":"21_CR23","first-page":"551","volume":"82","author":"R. Matsumoto","year":"1999","unstructured":"Matsumoto, R.: Using C\n                  \n                    ab\n                   curves in the function field sieve. IEICE Trans. Fundamentals\u00a0E82-A, 551\u2013552 (1999)","journal-title":"IEICE Trans. Fundamentals"},{"issue":"5","key":"21_CR24","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.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inform. Theory\u00a039(5), 1639\u20131646 (1993)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"21_CR25","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s00200-006-0017-6","volume":"17","author":"D. Page","year":"2006","unstructured":"Page, D., Smart, N.P., Vercauteren, F.: A comparison of MNT curves and supersingular curves. Appl. Algebra Engrg. Comm. Comput.\u00a017(5), 379\u2013392 (2006)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Pollard, J.: The lattice sieve. The Development of the Number Field Sieve, 43\u201349 (1991)","DOI":"10.1007\/BFb0091538"},{"issue":"2","key":"21_CR27","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1080\/10586458.1992.10504250","volume":"1","author":"C. Pomerance","year":"1992","unstructured":"Pomerance, C., Smith, J.W.: Reduction of huge, sparse matrices over finite fields via created catastrophes. Experiment. Math.\u00a01(2), 89\u201394 (1992)","journal-title":"Experiment. Math."},{"issue":"1","key":"21_CR28","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1137\/S0895480100372668","volume":"16","author":"O. Schirokauer","year":"2003","unstructured":"Schirokauer, O.: The special function field sieve. SIAM J. Discrete Math.\u00a016(1), 81\u201398 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"21_CR29","unstructured":"Wambach, G., Wettig, H.: Block sieving algorithms. Technical Report 190, Informatik, Universit\u00e4t zu K\u00f6ln (1995)"},{"issue":"1","key":"21_CR30","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"D.H. Wiedemann","year":"1986","unstructured":"Wiedemann, D.H.: Solving sparse linear equations over finite fields. IEEE Trans. Inform. Theory\u00a032(1), 54\u201362 (1986)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13013-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:44:50Z","timestamp":1558277090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13013-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130120","9783642130137"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13013-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}