{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:04:52Z","timestamp":1776845092888,"version":"3.51.2"},"reference-count":6,"publisher":"American Mathematical Society (AMS)","issue":"256","license":[{"start":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T00:00:00Z","timestamp":1182988800000},"content-version":"am","delay-in-days":365,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>The general number field sieve (GNFS) is the asymptotically fastest algorithm for factoring large integers. Its runtime depends on a good choice of a polynomial pair. In this article we present an improvement of the polynomial selection method of Montgomery and Murphy which has been used in recent GNFS records.<\/p>","DOI":"10.1090\/s0025-5718-06-01870-9","type":"journal-article","created":{"date-parts":[[2006,8,16]],"date-time":"2006-08-16T10:28:45Z","timestamp":1155724125000},"page":"2037-2047","source":"Crossref","is-referenced-by-count":37,"title":["On polynomial selection for the general number field sieve"],"prefix":"10.1090","volume":"75","author":[{"given":"Thorsten","family":"Kleinjung","sequence":"first","affiliation":[]}],"member":"14","published-online":{"date-parts":[[2006,6,28]]},"reference":[{"key":"1","unstructured":"S. Cavallar, W. M. Lioen, H. J. J. teRiele, B. Dodson, A. K. Lenstra, P. L. Montgomery, B. Murphy et al., Factorization of a 512-bit RSA modulus, Report MAS-R0007, CWI."},{"key":"2","unstructured":"J. Franke, T. Kleinjung et al., RSA-576, E-mail announcement, 2003. \\url{http:\/\/www.crypto-world.com\/announcements\/rsa576.txt}"},{"key":"3","isbn-type":"print","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0091535","article-title":"The number field sieve: an annotated bibliography","author":"Lenstra, H. W., Jr.","year":"1993","ISBN":"https:\/\/id.crossref.org\/isbn\/3540570136"},{"key":"4","isbn-type":"print","first-page":"199","article-title":"On quadratic polynomials for the number field sieve","author":"Murphy, Brian","year":"1998","ISBN":"https:\/\/id.crossref.org\/isbn\/9813083921"},{"key":"5","isbn-type":"print","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BFb0054858","article-title":"Modelling the yield of number field sieve polynomials","author":"Murphy, Brian","year":"1998","ISBN":"https:\/\/id.crossref.org\/isbn\/3540646574"},{"key":"6","unstructured":"B. A. Murphy, Polynomial selection for the Number Field Sieve Integer Factorisation Algorithm, Ph.D. thesis, The Australian National University, 1999."}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/2006-75-256\/S0025-5718-06-01870-9\/S0025-5718-06-01870-9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/2006-75-256\/S0025-5718-06-01870-9\/S0025-5718-06-01870-9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T14:41:37Z","timestamp":1776782497000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2006-75-256\/S0025-5718-06-01870-9\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,28]]},"references-count":6,"journal-issue":{"issue":"256","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["S0025-5718-06-01870-9"],"URL":"https:\/\/doi.org\/10.1090\/s0025-5718-06-01870-9","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2006,6,28]]}}}