{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:25:05Z","timestamp":1746296705490},"reference-count":27,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9635,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1987,3]]},"DOI":"10.1016\/0890-5401(87)90030-7","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"167-179","source":"Crossref","is-referenced-by-count":15,"title":["Reductions among number theoretic problems"],"prefix":"10.1016","volume":"72","author":[{"given":"Heather","family":"Woll","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(87)90030-7_BIB1","author":"Angluin","year":"1982"},{"key":"10.1016\/0890-5401(87)90030-7_BIB2","author":"Angluin","year":"1983"},{"key":"10.1016\/0890-5401(87)90030-7_BIB3","series-title":"Proceedings, 14th Annual ACM Symposium on Theory of Computing","first-page":"290","article-title":"Fast algorithms under the Extended Riemann Hypothesis: a concrete estimate","author":"Bach","year":"1982"},{"key":"10.1016\/0890-5401(87)90030-7_BIB4","series-title":"Discrete logarithms and factoring","author":"Bach","year":"1983"},{"key":"10.1016\/0890-5401(87)90030-7_BIB5","series-title":"Proceedings, 16th Annual ACM Symposium on Theory of Computing","first-page":"183","article-title":"Sums of divisors, perfect numbers and factoring","author":"Bach","year":"1984"},{"key":"10.1016\/0890-5401(87)90030-7_BIB6","series-title":"IEEE CRYPTO 82 Workshop on Communication Security","article-title":"A simple secure pseudo-random number generator","author":"Blum","year":"1982"},{"key":"10.1016\/0890-5401(87)90030-7_BIB7","series-title":"Proceedings, 23rd Annual IEEE Symposium on Foundations of Computer Science","first-page":"112","article-title":"How to generate cryptographically strong sequences of pseudo random bits","author":"Blum","year":"1982"},{"key":"10.1016\/0890-5401(87)90030-7_BIB8_1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1090\/S0025-5718-1981-0595059-1","article-title":"Asymptotically fast factorization of integers","volume":"36","author":"Dixon","year":"1981","journal-title":"Math. Comp."},{"key":"10.1016\/0890-5401(87)90030-7_BIB8_2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1090\/S0025-5718-1981-0595059-1","article-title":"Asymptotically fast factorization of integers","volume":"36","author":"Dixon","year":"1981","journal-title":"Math. Comp."},{"key":"10.1016\/0890-5401(87)90030-7_BIB9","author":"Finn","year":"1982"},{"key":"10.1016\/0890-5401(87)90030-7_BIB10","series-title":"Proceedings, 14th Annual ACM Symposium on Theory of Computing","first-page":"365","article-title":"Probabilistic encryption and how to play mental poker keeping secret all partial information","author":"Goldwasser","year":"1982"},{"key":"10.1016\/0890-5401(87)90030-7_BIB11","series-title":"Probabilistic encryption","author":"Goldwasser","year":"1981"},{"key":"10.1016\/0890-5401(87)90030-7_BIB12","series-title":"Proceedings, 15th Annual ACM Symposium on Theory of Computing","first-page":"431","article-title":"Strong signature schemes","author":"Goldwasser","year":"1982"},{"key":"10.1016\/0890-5401(87)90030-7_BIB13","author":"Hardy","year":"1979"},{"key":"10.1016\/0890-5401(87)90030-7_BIB14","volume":"Vol. 2","author":"Knuth","year":"1981"},{"key":"10.1016\/0890-5401(87)90030-7_BIB15","author":"LeVeque","year":"1977"},{"key":"10.1016\/0890-5401(87)90030-7_BIB16","author":"Lipson","year":"1981"},{"key":"10.1016\/0890-5401(87)90030-7_BIB17","author":"Long","year":"1981"},{"key":"10.1016\/0890-5401(87)90030-7_BIB18","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","article-title":"Riemann's Hypothesis and tests for primality","volume":"13","author":"Miller","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(87)90030-7_BIB19_1","first-page":"129","article-title":"A method of factoring and the factorization of F7","volume":"29","author":"Morrison","year":"1975","journal-title":"Math. Comp."},{"key":"10.1016\/0890-5401(87)90030-7_BIB19_2","first-page":"183","article-title":"A method of factoring and the factorization of F7","volume":"29","author":"Morrison","year":"1975","journal-title":"Math. Comp."},{"key":"10.1016\/0890-5401(87)90030-7_BIB20","author":"Rabin","year":"1979"},{"key":"10.1016\/0890-5401(87)90030-7_BIB21","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","article-title":"Probabilistic algorithm for testing primality","volume":"12","author":"Rabin","year":"1980","journal-title":"J. Number Theory"},{"key":"10.1016\/0890-5401(87)90030-7_BIB22","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public-key crypto-systems","volume":"21","author":"Rivest","year":"1978","journal-title":"Comm. ACM"},{"issue":"No. 1","key":"10.1016\/0890-5401(87)90030-7_BIB23_1","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","article-title":"A fast Monte-Carlo test for primality","volume":"6","author":"Solovay","year":"1978","journal-title":"SIAM J. Comput."},{"issue":"No. 1","key":"10.1016\/0890-5401(87)90030-7_BIB23_2","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1137\/0207009","article-title":"A fast Monte-Carlo test for primality","volume":"7","author":"Solovay","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(87)90030-7_BIB24","author":"Tompa","year":"1983"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900307?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900307?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:26:13Z","timestamp":1548879973000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540187900307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,3]]}},"alternative-id":["0890540187900307"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(87)90030-7","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1987,3]]}}}