{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T13:51:15Z","timestamp":1711547475028},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/bf00128046","type":"journal-article","created":{"date-parts":[[2004,11,4]],"date-time":"2004-11-04T03:49:21Z","timestamp":1099540161000},"page":"191-216","source":"Crossref","is-referenced-by-count":5,"title":["Factoring: Algorithms, computations, and computers"],"prefix":"10.1007","volume":"1","author":[{"given":"Duncan A.","family":"Buell","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"342","volume-title":"Number Theory","author":"Z. I. Borevich","year":"1966","unstructured":"Borevich, Z. I., and Shafarevich, I. R. 1966. Number Theory. Academic Press, New York, pp. 342?343."},{"key":"CR2","volume-title":"Factorizations of bn \u00b1 1, b = 2, 3, 5, 6, 7, 10, 11, 12, up to High Powers","author":"J. Brillhart","year":"1983","unstructured":"Brillhart, J., Lehmer, D. H., Selfridge, J. L., Tuckerman, B., and Wagstaff, S. S. Jr. 1983. Factorizations of b n \u00b1 1, b = 2, 3, 5, 6, 7, 10, 11, 12, up to High Powers, American Mathematical Society, Providence, R. I."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1090\/S0025-5718-1977-0441914-1","volume":"31","author":"D. A. Buell","year":"1977","unstructured":"Buell, D. A. 1977. Small class numbers and extreme values of L-functions of quadratic fields. Mathematics of Computation, 31, 786?796.","journal-title":"Mathematics of Computation"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Chiarulli, D. M., Rudd, W. G., and Buell, D. A. 1985. DRAFT?A dynamically reconfigurable processor for integer arithmetic. Proceedings, 7th International Symposium on Computer Arithmetic, Urbana, IL, pp. 309?317.","DOI":"10.1109\/ARITH.1985.6158935"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-1-4684-4730-9_9","volume-title":"Advances in Cryptology","author":"J. A. Davis","year":"1984","unstructured":"Davis, J. A., and Holdridge, Diane B. 1984. Factorization using the quadratic sieve algorithm. In Advances in Cryptology (David Chaum, ed), Plenum Press, New York, pp. 103?113."},{"key":"CR6","unstructured":"Davis, J. A., and Holdridge, Diane B. 1984. Most wanted factorizations using the quadratic sieve. Sandia Technical Report SAND84-1658 UC-32 (August)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1080\/00029890.1984.11971425","volume":"91","author":"J. D. Dixon","year":"1984","unstructured":"Dixon, J. D. 1984. Factorization and primality tests. American Mathematical Monthly, 91, 333?352.","journal-title":"American Mathematical Monthly"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1090\/S0025-5718-1983-0701639-4","volume":"41","author":"J. L. Gerver","year":"1983","unstructured":"Gerver, J. L. 1983. Factoring large numbers with a quadratic sieve. Mathematics of Computation, 41, 287?294.","journal-title":"Mathematics of Computation"},{"key":"CR9","first-page":"49","volume":"16","author":"R. K. Guy","year":"1976","unstructured":"Guy, R. K. 1976, How to factor a number.Congressus Numerantium, 16, 49?89.","journal-title":"Congressus Numerantium"},{"key":"CR10","first-page":"210","volume-title":"Algebraische Zahlen","author":"E. Hecke","year":"1970","unstructured":"Hecke, E. 1970. Algebraische Zahlen, Chelsea, New York, pp. 210?217."},{"key":"CR11","unstructured":"Knuth, D. E. 1981. The Art of Computer Programming, vol. 2, Seminumerical Algorithms, 2nd ed., Addison-Wesley, Reading, MA, pp. 441ff."},{"key":"CR12","unstructured":"Lenstra, H. W. Jr., informal communication."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P. Montgomery","year":"1985","unstructured":"Montgomery, P. 1985. Modular multiplication without division. Mathematics of Computation, 44, pp. 519?521.","journal-title":"Mathematics of Computation"},{"key":"CR14","unstructured":"Montgomery, P., letter dated March 22, 1985."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1090\/S0002-9904-1971-12711-8","volume":"77","author":"M. A. Morrison","year":"1971","unstructured":"Morrison, M. A., and Brillhart, J. 1971. The factorization of F 7. Bulletin of the AMS, 77, 264.","journal-title":"Bulletin of the AMS"},{"key":"CR16","first-page":"183","volume":"29","author":"M. A. Morrison","year":"1975","unstructured":"Morrison, M. A., and Brillhart, J. 1975. A method of factoring and the factorization of F 7. Mathematics of Computation, 29, 183?205.","journal-title":"Mathematics of Computation"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1017\/S0305004100049252","volume":"76","author":"J. M. Pollard","year":"1974","unstructured":"Pollard, J. M. 1974. Theorems on factoring and primality testing. Proceedings of the Cambridge Philosophical Society, 76, 521?528.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"J. M. Pollard","year":"1975","unstructured":"Pollard, J. M. 1975. A Monte Carlo method for factorization. BIT, 15, 331?334.","journal-title":"BIT"},{"key":"CR19","first-page":"89","volume-title":"Computational Methods in Number Theory","author":"C. Pomerance","year":"1983","unstructured":"Pomerance, C. 1983. Analysis and comparison of some integer factoring algorithms. In Computational Methods in Number Theory (H. W. Lenstra Jr., and R. Tijdeman, eds.), Math. Centrum, Amsterdam, pp. 89?139."},{"key":"CR20","first-page":"99","volume":"37","author":"C. Pomerance","year":"1983","unstructured":"Pomerance, C., and Wagstaff, S. S. Jr. 1983. Implementation of the continued fraction integer factoring algorithm. Congressus Numerantium, 37, 99?118.","journal-title":"Congressus Numerantium"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-1-4684-4730-9_7","volume-title":"Advances in Cryptology","author":"C. Pomerance","year":"1984","unstructured":"Pomerance, C., Smith, J. W., and Wagstaff, S. S. Jr. 1984. New ideas for factoring large integers. Advances in Cryptology (David Chaum, ed.), Plenum Press, New York, pp. 81?86."},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"Rudd, W. G., Chiarulli, D. M., and Buell, D. A. 1984. A high performance factoring machine. Proceedings of the 11th International Symposium on Computer Architecture, Ann Arbor, pp. 297?300.","DOI":"10.1145\/800015.808198"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1090\/S0025-5718-1984-0744939-5","volume":"43","author":"C. P. Schnorr","year":"1984","unstructured":"Schnorr, C. P., and Lenstra, H. W. Jr. 1984. A Monte Carlo factoring algorithm with linear storage. Mathematics of Computation, 43, 289?312.","journal-title":"Mathematics of Computation"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","volume":"28","author":"C. L. Seitz","year":"1985","unstructured":"Seitz, C. L. 1985. The cosmic cube. Communications of the ACM, 28, 22?33.","journal-title":"Communications of the ACM"},{"key":"CR25","first-page":"415","volume-title":"Class number, a theory of factorization, and genera","author":"D. Shanks","year":"1969","unstructured":"Shanks, D. 1969. Class number, a theory of factorization, and genera. Proc. Symp. in Pure Maths., vol. 20, American Mathematical Society, Providence, R. I., pp. 415?440."},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"Silverman, R. D. 1987. The multiple polynomial quadratic sieve, to appear.","DOI":"10.1090\/S0025-5718-1987-0866119-8"},{"key":"CR27","unstructured":"Smith, J. W., and Wagstaff, S. S., Jr. 1983. An extended precision operand computer. Proceedings of the 21st Southeast Region ACM Conference, pp. 209?216."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01389745","volume":"23","author":"J. Tate","year":"1974","unstructured":"Tate, J. 1974. The arithmetic of elliptic curves. Inventiones mathematicae, 23, 179?206.","journal-title":"Inventiones mathematicae"},{"key":"CR29","unstructured":"Wagstaff, S. S., Jr. Updates to the Cunningham Table, informal communications."},{"key":"CR30","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"IT-32","author":"D. Wiedemann","year":"1986","unstructured":"Wiedemann, D. 1986. Solving sparse linear equations over finite fields. IEEE Transactions on Information Theory, IT-32, 54?62.","journal-title":"IEEE Transactions on Information Theory"},{"key":"CR31","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-1-4684-4730-9_6","volume-title":"Advances in Cryptology","author":"H. C. Williams","year":"1984","unstructured":"Williams, H. C. 1984. An overview of factoring. In Advances in Cryptology (David Chaum, ed.), Plenum Press, New York, pp. 71?80."},{"key":"CR32","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1216\/RMJ-1985-15-2-621","volume":"15","author":"H. C. Williams","year":"1985","unstructured":"Williams, H. C. 1985. Continued fractions and number-theoretic computations. Rocky Mountain Journal of Mathematics, 15, 621?655.","journal-title":"Rocky Mountain Journal of Mathematics"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-1-4684-4730-9_8","volume-title":"Advances in Cryptology","author":"M. C. Wunderlich","year":"1984","unstructured":"Wunderlich, M. C. 1984. Factoring numbers on the Massively Parallel Processor. In Advances in Cryptology (David Chaum, ed.), Plenum Press, New York, pp. 87?102."},{"key":"CR34","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1090\/S0025-5718-1985-0771047-0","volume":"44","author":"M. C. Wunderlich","year":"1985","unstructured":"Wunderlich, M. C. 1985. Implementing the continued fraction factoring algorithm on parallel machines. Mathematics of Computation, 44, 251?260.","journal-title":"Mathematics of Computation"},{"key":"CR35","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/TC.1984.5009314","volume":"C-33","author":"V. Zakharov","year":"1984","unstructured":"Zakharov, V. 1984. Parallelism and array processing. IEEE Transactions on Computers, C-33, 45?78.","journal-title":"IEEE Transactions on Computers"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00128046.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00128046\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00128046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T22:45:42Z","timestamp":1682808342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00128046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987]]}},"alternative-id":["BF00128046"],"URL":"https:\/\/doi.org\/10.1007\/bf00128046","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987]]}}}