{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:41:07Z","timestamp":1725468067371},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646570"},{"type":"electronic","value":"9783540691136"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054858","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T12:06:06Z","timestamp":1154433966000},"page":"137-150","source":"Crossref","is-referenced-by-count":8,"title":["Modelling the yield of number field sieve polynomials"],"prefix":"10.1007","author":[{"given":"Brian","family":"Murphy","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,24]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1090\/S0025-5718-96-00763-6","volume":"65","author":"E Bach","year":"1996","unstructured":"E Bach and R Peralta, \u201cAsymptotic Semismoothness Probabilities\u201d Math. Comp.\n                65 (1996), pp 1717\u20131735.","journal-title":"Math. Comp."},{"key":"9_CR2","unstructured":"H Boender, \u201cFactoring Integers with the Quadratic Sieve\u201d, PhD Thesis, University of Leiden, 1997."},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BFb0091539","volume":"1554","author":"J. P. Buhler","year":"1993","unstructured":"J P Buhler, H W Lenstra Jr, C Pomerance, \u201cFactoring Integers with the Number Field Sieve\u201d, The Development of the Number Field Sieve, LNM\n                1554 (1993) pp 50\u201394.","journal-title":"The Development of the Number Field Sieve, LNM"},{"issue":"10","key":"9_CR4","first-page":"1","volume":"22A","author":"K Dickman","year":"1930","unstructured":"K Dickman, \u201cOn the Frequency of Numbers Containing Prime Factors of a Certain Relative Magnitude\u201d, Ark. Mat. Astronomi och Fysik\n                22A 10 (1930), pp 1\u201314.","journal-title":"Ark. Mat. Astronomi och Fysik"},{"issue":"3","key":"9_CR5","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1080\/10586458.1996.10504590","volume":"5","author":"M Elkenbracht-Huizing","year":"1996","unstructured":"M Elkenbracht-Huizing, \u201cAn Implementation of the Number Field Sieve\u201d, Experimental Mathematics 5(3) (1996) pp 375\u2013389.","journal-title":"Experimental Mathematics"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/3-540-61581-4_45","volume":"1122","author":"M Elkenbracht-Huizing","year":"1996","unstructured":"M Elkenbracht-Huizing, \u201cA Multiple Polynomial General Number Field Sieve\u201d, Algorithmic Number Theory, LNCS\n                1122 (1996) pp 99\u2013114.","journal-title":"Algorithmic Number Theory, LNCS"},{"key":"9_CR7","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-58691-1_38","volume":"877","author":"R. A. Golliver","year":"1994","unstructured":"R A Golliver, A K Lenstra and K S McCurley, \u201cLattice Sieving and Trial Division\u201d, Algorithmic Number Theory, LNCS\n                877 (1994) pp 18\u201327.","journal-title":"Algorithmic Number Theory, LNCS"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(76)90050-5","volume":"3","author":"D. E. Knuth","year":"1976","unstructured":"D E Knuth and L T Pardo, \u201cAnalysis of a Simple Factorization Algorithm\u201d, Theor. Comp. Sci.\n                3 (1976) pp 321\u2013348.","journal-title":"Theor. Comp. Sci."},{"key":"9_CR9","unstructured":"R Lambert, \u201cComputational Aspects of Discrete Logarithms\u201d, PhD Thesis, Univeristy of Waterloo, 1996."},{"issue":"3","key":"9_CR10","first-page":"199","volume":"20","author":"B Murphy","year":"1998","unstructured":"B Murphy and R P Brent, \u201cOn Quadratic Polynomials for the Number Field Sieve\u201d, Computing Theory 98, ACSC\n                20(3) (1998), Springer, pp 199\u2013215.","journal-title":"Computing Theory 98, ACSC"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T19:23:45Z","timestamp":1549913025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054858"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646570","9783540691136"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0054858","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}