{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:13:30Z","timestamp":1781259210153,"version":"3.54.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0020-0190(90)90195-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:10:11Z","timestamp":1027642211000},"page":"261-267","source":"Crossref","is-referenced-by-count":49,"title":["On the deterministic complexity of factoring polynomials over finite fields"],"prefix":"10.1016","volume":"33","author":[{"given":"Victor","family":"Shoup","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90195-4_BIB1","series-title":"The Design and Analysis of Computer Algorithm","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(90)90195-4_BIB2","first-page":"453","article-title":"Realistic analysis of some randomized algorithms","author":"Bach","year":"1987","journal-title":"Proc. 19th Annual ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(90)90195-4_BIB3","series-title":"Computer Sciences Technical Report No. 757","article-title":"Factoring, polynomials using fewer random bits","author":"Bach","year":"1988"},{"key":"10.1016\/0020-0190(90)90195-4_BIB4","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/SFCS.1981.37","article-title":"Probabilistic algorithms in finite fields","author":"Ben-Or","year":"1981","journal-title":"Proc. 22nd Annual Symp. on Foundations of Computer Science"},{"issue":"111","key":"10.1016\/0020-0190(90)90195-4_BIB5","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\/0020-0190(90)90195-4_BIB6","series-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"Borodin","year":"1975"},{"issue":"3","key":"10.1016\/0020-0190(90)90195-4_BIB7","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1109\/TIT.1983.1056666","article-title":"Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials","volume":"29","author":"Camion","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0020-0190(90)90195-4_BIB8","series-title":"Department of Computer Science Technical Report No. 87-35","article-title":"Fast multiplication of polynomials over arbitrary rings","author":"Cautor","year":"1987"},{"issue":"154","key":"10.1016\/0020-0190(90)90195-4_BIB9","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\/0020-0190(90)90195-4_BIB10","series-title":"Eurosam'79","first-page":"317","article-title":"Factoring univariate integral polynomials in polynomial average time","volume":"72","author":"Collins","year":"1979"},{"key":"10.1016\/0020-0190(90)90195-4_BIB11","first-page":"1","article-title":"Matrix multiplication via Behrend's method","author":"Coppersmith","year":"1987","journal-title":"Proc. 19th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(90)90195-4_BIB12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(87)90081-8","article-title":"Factoring polynomials and primitive elements for special primes","volume":"52","author":"von zur Gathen","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(90)90195-4_BIB13","author":"Hafner","year":"1987","journal-title":"On the distribution of running times of certain integer factoring algorithms"},{"key":"10.1016\/0020-0190(90)90195-4_BIB14","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."},{"issue":"2","key":"10.1016\/0020-0190(90)90195-4_BIB15","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\/0020-0190(90)90195-4_BIB16","article-title":"Equations over Finite Fields","volume":"536","author":"Schmidt","year":"1976"},{"key":"10.1016\/0020-0190(90)90195-4_BIB17","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00289470","article-title":"Schnelle Multiplikation von Polynomen \u00fcber K\u00f6rpern der Charakteristik 2","volume":"7","author":"Sch\u00f6nhage","year":"1977","journal-title":"Acta Inform."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019090901954?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019090901954?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:58:09Z","timestamp":1555073889000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019090901954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["0020019090901954"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90195-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}