{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T07:15:08Z","timestamp":1776755708645,"version":"3.51.2"},"reference-count":28,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,6,1]],"date-time":"1982-06-01T00:00:00Z","timestamp":391737600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1982,6]]},"DOI":"10.1016\/0196-6774(82)90012-8","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"101-127","source":"Crossref","is-referenced-by-count":15,"title":["Refined analysis and improvements on some factoring algorithms"],"prefix":"10.1016","volume":"3","author":[{"given":"C.P","family":"Schnorr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(82)90012-8_BIB1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(82)90012-8_BIB2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.2307\/2005475","article-title":"A method of factorization and the factorization of F7","volume":"29","author":"Morrison","year":"1975","journal-title":"Math. Comput."},{"key":"10.1016\/0196-6774(82)90012-8_BIB3","series-title":"1969 Number Theory Institute","first-page":"415","article-title":"Class number, a theory of factorization and genera","author":"Shanks","year":"1971"},{"key":"10.1016\/0196-6774(82)90012-8_BIB4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1090\/S0025-5718-1975-0366796-6","article-title":"On factorization, with a suggested new approach","volume":"29","author":"Miller","year":"1975","journal-title":"Math. Comput."},{"key":"10.1016\/0196-6774(82)90012-8_BIB5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1090\/S0025-5718-1981-0595059-1","article-title":"Asymptotical fast factorization of integers","volume":"36","author":"Dixon","year":"1981","journal-title":"Math. Comp."},{"key":"10.1016\/0196-6774(82)90012-8_BIB6","article-title":"Algorithmes de factorisation d'entiers","author":"Monier","year":"1980"},{"key":"10.1016\/0196-6774(82)90012-8_BIB7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01933667","article-title":"A Monte Carlo method for factorization","volume":"15","author":"Pollard","year":"1975","journal-title":"BIT"},{"key":"10.1016\/0196-6774(82)90012-8_BIB8","series-title":"Proc. Fifth Manitoba Conference on Numerical Math.","first-page":"49","article-title":"How to factor a number","author":"Guy","year":"1975"},{"key":"10.1016\/0196-6774(82)90012-8_BIB9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/S1385-7258(51)50008-2","article-title":"On the number of positive integers \u2a7d x and free of prime factors >y","volume":"13","author":"de Bruijn","year":"1951","journal-title":"Indag. Math."},{"key":"10.1016\/0196-6774(82)90012-8_BIB10","first-page":"239","article-title":"On the number of positive integers \u2a7d x and free of prime factors > y, II","volume":"69","author":"de Bruijn","year":"1966"},{"key":"10.1016\/0196-6774(82)90012-8_BIB11","author":"Knuth","year":"1980"},{"key":"10.1016\/0196-6774(82)90012-8_BIB12","first-page":"521","article-title":"Theorems on factorization and primality testing","volume":"76","author":"Pollard","year":"1974"},{"key":"10.1016\/0196-6774(82)90012-8_BIB13","first-page":"1","article-title":"Einige Resultate \u00fcber Berechnungskomplexit\u00e4t","volume":"78","author":"Strassen","year":"1976","journal-title":"Jber. Deutsch. Math.-Verein."},{"key":"10.1016\/0196-6774(82)90012-8_BIB14","first-page":"328","article-title":"A running time analysis of Brillhart's continued fraction method","author":"Wunderlich","year":"1979"},{"key":"10.1016\/0196-6774(82)90012-8_BIB15","series-title":"Proc. Boulder Number Theory Conference","first-page":"217","article-title":"The infrastructure of real quadratic fields and its application","author":"Shanks","year":"1972"},{"key":"10.1016\/0196-6774(82)90012-8_BIB16","series-title":"On the Calculation of Regulators and Class Numbers of Quadratic Fields","author":"Lenstra","year":"1980"},{"key":"10.1016\/0196-6774(82)90012-8_BIB17_1","series-title":"Disquisitiones Arithmeticae","author":"Gauss","year":"1801"},{"key":"10.1016\/0196-6774(82)90012-8_BIB17_2","series-title":"Untersuchungen \u00fcber h\u00f6here Arithmetik","year":"1889"},{"key":"10.1016\/0196-6774(82)90012-8_BIB18","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0209024","article-title":"Probabilistic algorithms in finite fields","volume":"9","author":"Rabin","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(82)90012-8_BIB19","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF02242389","article-title":"An algorithm for division of power series","volume":"10","author":"Sieveking","year":"1972","journal-title":"Computing"},{"key":"10.1016\/0196-6774(82)90012-8_BIB20","series-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"Borodin","year":"1975"},{"key":"10.1016\/0196-6774(82)90012-8_BIB21","series-title":"Analysis of Some New Cycle Finding and Factorization Algorithms","author":"Brent","year":"1979"},{"key":"10.1016\/0196-6774(82)90012-8_BIB22","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0304-3975(76)90050-5","article-title":"Analysis of a simple factorization algorithm","volume":"3","author":"Knuth","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0196-6774(82)90012-8_BIB23","volume":"Tome I","author":"Legendre","year":"1798","journal-title":"Theorie des Nombres"},{"key":"10.1016\/0196-6774(82)90012-8_BIB24","series-title":"MIT Report","article-title":"Using Hyperbolic Tangents in Integer Factoring","author":"Rivest","year":"1979"},{"key":"10.1016\/0196-6774(82)90012-8_BIB25","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","article-title":"Schnelle Multiplikation gro\u00dfer Zahlen","volume":"7","author":"Sch\u00f6nhage","year":"1971","journal-title":"Computing"},{"key":"10.1016\/0196-6774(82)90012-8_BIB26","series-title":"Report","article-title":"Analysis and Comparison of Some Integer Factoring Algorithms","author":"Pomerance","year":"1981"},{"key":"10.1016\/0196-6774(82)90012-8_BIB27","series-title":"Report","article-title":"Ein Effizienzvergleich der Faktorisierungsverfahren von Morrison-Brillhart und Schroeppel","author":"Sattler","year":"1981"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900128?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900128?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:52:01Z","timestamp":1548744721000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677482900128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["0196677482900128"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(82)90012-8","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}