{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T08:38:45Z","timestamp":1776760725029,"version":"3.51.2"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1988,4,1]],"date-time":"1988-04-01T00:00:00Z","timestamp":575856000000},"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":[[1988,4]]},"DOI":"10.1007\/bf00154339","type":"journal-article","created":{"date-parts":[[2004,11,2]],"date-time":"2004-11-02T20:28:07Z","timestamp":1099427287000},"page":"273-290","source":"Crossref","is-referenced-by-count":28,"title":["Parallel implementation of the quadratic sieve"],"prefix":"10.1007","volume":"1","author":[{"given":"Thomas R.","family":"Caron","sequence":"first","affiliation":[]},{"given":"Robert D.","family":"Silverman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Factorizations of bn \u00b1 1 for 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 for b = 2, 3, 5, 6, 7, 10, 11, 12, up to High Powers. American Mathematical Society, Providence, Rhode Island."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01840433","volume":"1","author":"D. Coppersmith","year":"1986","unstructured":"Coppersmith, D., Odlyzko, A.M., and Schroeppel, R. 1986. Discrete logarithms in GF(p). Algorithmica, 1: 1?15.","journal-title":"Algorithmica"},{"key":"CR3","unstructured":"Davis, J.A., and Holdridge, D.B. 1983. Factorization using the quadratic sieve algorithm. Sandia National Laboratories Tech. Rept. SAND 83-1346."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Davis, J.A., Holdridge, D.B., and Simmons, G.J. 1985. Status report on factoring. Advances in Cryptology: Lecture Notes in Computer Science, pp 183?215.","DOI":"10.1007\/3-540-39757-4_18"},{"key":"CR5","first-page":"365","volume-title":"The Art of Computer Programming, vol. 2, Seminumerical Algorithms","author":"D.E. Knuth","year":"1981","unstructured":"Knuth, D.E. 1981. The Art of Computer Programming, vol. 2, Seminumerical Algorithms, 2nd ed. Addison-Wesley, Reading, Massachusetts, p. 365.","edition":"2nd ed."},{"key":"CR6","unstructured":"Montgomery, P. 1985. Personal communication."},{"key":"CR7","first-page":"183","volume":"29","author":"M. Morrison","year":"1975","unstructured":"Morrison, M., and Brillhart, J. 1975. A method of factoring and the factorization of F7. Math. Comput., 29: 183?205.","journal-title":"Math. Comput."},{"key":"CR8","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.), Mathematisch Centrum, Amsterdam, pp. 89?140."},{"key":"CR9","unstructured":"Pomerance, C. 1985. A pipe-line architecture for factoring large integers with the quadratic sieve algorithm. SIAM J. Comput. Special Issue on Cryptography. To appear."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1090\/S0025-5718-1987-0866119-8","volume":"48","author":"R.D. Silverman","year":"1987","unstructured":"Silverman, R.D., 1987. The multiple polynomial quadratic sieve. Math. Comput. 48: 329?339.","journal-title":"Math. Comput."},{"key":"CR11","unstructured":"Wagstaff, S.S. Jr. 1986. Personal communication."},{"key":"CR12","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 Trans. Information Theory, IT-32, 54?61.","journal-title":"IEEE Trans. Information Theory"},{"key":"CR13","unstructured":"Wunderlich, M. 1986. Personal communication."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00154339.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00154339\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00154339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T07:23:41Z","timestamp":1554276221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00154339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,4]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,4]]}},"alternative-id":["BF00154339"],"URL":"https:\/\/doi.org\/10.1007\/bf00154339","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,4]]}}}