{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:05:23Z","timestamp":1725584723438},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642209000"},{"type":"electronic","value":"9783642209017"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20901-7_11","type":"book-chapter","created":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T10:11:30Z","timestamp":1307182290000},"page":"191-200","source":"Crossref","is-referenced-by-count":3,"title":["An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic"],"prefix":"10.1007","author":[{"given":"Kenichiro","family":"Hayasaka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"A Course in Computational Algebraic Number Theory. GTM","author":"H. Cohen","year":"1995","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. GTM, vol.\u00a0138. Springer, Heidelberg (1995)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01840433","volume":"1","author":"D. Coppersmith","year":"1986","unstructured":"Coppersmith, D., Odlyzko, A., Schroppel, R.: Discrete Logarithms in GF(p). Algorithmica\u00a01, 1\u201315 (1986)","journal-title":"Algorithmica"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/0406010","volume":"6","author":"D. Gordon","year":"1993","unstructured":"Gordon, D.: Discrete Logarithms in GF(p) Using the Number Field Sieve. SIAM J. Discrete Math.\u00a06, 124\u2013138 (1993)","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1090\/S0025-5718-02-01482-5","volume":"72","author":"A. Joux","year":"2003","unstructured":"Joux, A., Lercier, R.: Improvements to the General Number Field Sieve for Discrete Logarithms in Prime Fields. Math. Comp.\u00a072, 953\u2013967 (2003)","journal-title":"Math. Comp."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1090\/S0025-5718-06-01870-9","volume":"75","author":"T. Kleinjung","year":"2006","unstructured":"Kleinjung, T.: On Polynomial Selection for the General Number Field Sieve. Math. Comp.\u00a075, 2037\u20132047 (2006)","journal-title":"Math. Comp."},{"key":"11_CR6","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":"11_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF00123958","volume":"1","author":"B. LaMacchia","year":"1991","unstructured":"LaMacchia, B., Odlyzko, A.: Computation of Discrete Logarithms in Prime Fields. Designs, Codes and Cryptography\u00a01, 47\u201362 (1991)","journal-title":"Designs, Codes and Cryptography"},{"key":"11_CR8","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":"11_CR9","doi-asserted-by":"publisher","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. Bur. Stand.\u00a049, 33\u201353 (1952)","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"11_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0091534","volume-title":"The Development of the Number Field Sieve. LNM","author":"A. Lenstra","year":"1993","unstructured":"Lenstra, A., Lenstra Jr., H.: The Development of the Number Field Sieve. LNM, vol.\u00a01554. Springer, Heidelberg (1993)"},{"key":"11_CR11","first-page":"513","volume":"261","author":"A. Lenstra","year":"1982","unstructured":"Lenstra, A., Lenstra Jr, H., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Ann.\u00a0261, 513\u2013534 (1982)","journal-title":"Mathematische Ann."},{"key":"11_CR12","unstructured":"Lercier, R.: Computations - Discrete Logarithms (2009), \n                  \n                    http:\/\/perso.univ-rennes1.fr\/reynald.lercier\/plugins\/getfilehtml\/getfilehtml7d2c.html?lng=en&id=6"},{"key":"11_CR13","unstructured":"Murphy, B.: Polynomial Selection for the Number Field Sieve Integer Factorisation Algorithm, PhD. thesis, The Australian National University (1999)"},{"key":"11_CR14","unstructured":"PARI\/GP, version 2.3.4, Bordeaux (2008), \n                  \n                    http:\/\/pari.math.u-bordeaux.fr\/"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1080\/10586458.1992.10504250","volume":"1","author":"C. Pomerance","year":"1992","unstructured":"Pomerance, C., Smith, J.: Reduction of Huge, Sparse Matrices over Finite Fields via Created Catastrophes. Experiment. Math.\u00a01, 89\u201394 (1992)","journal-title":"Experiment. Math."},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1098\/rsta.1993.0139","volume":"345","author":"O. Schirokauer","year":"1993","unstructured":"Schirokauer, O.: Discrete Logarithms and Local Units, Philos. Trans. Roy. Soc. London Ser. A\u00a0345, 409\u2013424 (1993)","journal-title":"Trans. Roy. Soc. London Ser. A"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.jalgor.2004.11.004","volume":"57","author":"O. Schirokauer","year":"2005","unstructured":"Schirokauer, O.: Virtual Logarithms. J. Algorithms\u00a057, 140\u2013147 (2005)","journal-title":"J. Algorithms"},{"key":"11_CR18","unstructured":"Schirokauer, O.: The Number Field Sieve for Integers of Low Weight. IACR Cryptology ePrint Archive,\u00a02006\/107 (2006)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1090\/S0025-5718-09-02198-X","volume":"79","author":"O. Schirokauer","year":"2010","unstructured":"Schirokauer, O.: The Number Field Sieve for Integers of Low Weight. Math. Comp.\u00a079, 583\u2013602 (2010)","journal-title":"Math. Comp."},{"key":"11_CR20","unstructured":"Solinas, J.: Generalized Mersenne Numbers, Technical Report CORR 99-39, University of Waterloo (1999)"}],"container-title":["Lecture Notes in Computer Science","Coding and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20901-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T02:57:19Z","timestamp":1553741839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20901-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642209000","9783642209017"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20901-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}