{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:39:28Z","timestamp":1775637568845,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"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":8539,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1016\/s0747-7171(08)80011-9","type":"journal-article","created":{"date-parts":[[2008,5,9]],"date-time":"2008-05-09T05:45:58Z","timestamp":1210311958000},"page":"229-239","source":"Crossref","is-referenced-by-count":9,"title":["Factoring polynomials using fewer random bits"],"prefix":"10.1016","volume":"9","author":[{"given":"Eric","family":"Bach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Shoup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(08)80011-9_bib1","series-title":"Proc. 19th Annual ACM Symp. on Theory of Computing","first-page":"453","article-title":"Realistic analysis of some randomized algorithms","author":"Bach","year":"1987"},{"key":"10.1016\/S0747-7171(08)80011-9_bib2","series-title":"Proc. 22nd Annual Symp. on Foundations of Computer Science","first-page":"394","article-title":"Probabilitstic algorithms in finite fields","author":"Ben-Or","year":"1981"},{"key":"10.1016\/S0747-7171(08)80011-9_bib3","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","article-title":"Factoring polynomials over large finite fields","volume":"24","author":"Berlekamp","year":"1970","journal-title":"Math. Comp."},{"key":"10.1016\/S0747-7171(08)80011-9_bib4","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","article-title":"A new algorithm for factoring polynomials over finite fields","volume":"36","author":"Cantor","year":"1981","journal-title":"Math. Comp."},{"key":"10.1016\/S0747-7171(08)80011-9_bib5","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/0196-6774(84)90022-1","article-title":"The NP-completeness column: an ongoing guide","volume":"5","author":"Johnson","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S0747-7171(08)80011-9_bib6","author":"Knuth","year":"1981"},{"key":"10.1016\/S0747-7171(08)80011-9_bib7","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\/S0747-7171(08)80011-9_bib8","article-title":"Equations over Finite Fields","volume":"536","author":"Schmidt","year":"1976"},{"key":"10.1016\/S0747-7171(08)80011-9_bib9","article-title":"Finding Witnesses Using Fewer Random Bits","author":"Shoup","year":"1987"},{"key":"10.1016\/S0747-7171(08)80011-9_bib10","article-title":"On the Deterministic Complexity of Factoring Polynomials over Finite Fields","author":"Shoup","year":"1988","journal-title":"University of Wisconsin-Madison, Computer Sciences Technical Report No. 782"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108800119?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108800119?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T17:59:02Z","timestamp":1546019942000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717108800119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["S0747717108800119"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(08)80011-9","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}