{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:25:46Z","timestamp":1780053946692,"version":"3.54.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"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":8904,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1989,3]]},"DOI":"10.1016\/0097-3165(89)90020-4","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T04:49:18Z","timestamp":1108010958000},"page":"285-300","source":"Crossref","is-referenced-by-count":62,"title":["On arithmetical algorithms over finite fields"],"prefix":"10.1016","volume":"50","author":[{"given":"David G","family":"Cantor","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(89)90020-4_BIB1","series-title":"Proceedings, Eighteenth Annual Symposium on Theory of Computing, Berkeley, CA","first-page":"350","article-title":"Finding irreducible polynomials over finite fields","author":"Adleman","year":"1986"},{"key":"10.1016\/0097-3165(89)90020-4_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0097-3165(89)90020-4_BIB3","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1137\/0204045","article-title":"Evaluating polynomials at fixed sets of points","volume":"14","author":"Aho","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0097-3165(89)90020-4_BIB4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1137\/0901009","article-title":"FFT as nested multiplication with a twist","volume":"1","author":"de Boor","year":"1980","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0097-3165(89)90020-4_BIB5","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\/0097-3165(89)90020-4_BIB6","series-title":"On Numbers and Games","author":"Conway","year":"1976"},{"key":"10.1016\/0097-3165(89)90020-4_BIB7","series-title":"Seminumerical Algorithms","first-page":"420","article-title":"The Art of Computer Programming","author":"Knuth","year":"1981"},{"key":"10.1016\/0097-3165(89)90020-4_BIB8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(83)90108-1","article-title":"On the complexity of multiplication in Finite Fields","volume":"22","author":"Lempel","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0097-3165(89)90020-4_BIB9","unstructured":"R. Lidl and H. Niederreiter, \u201cFinite Fields,\u201d Addison-Wesley, Reading, MA."},{"key":"10.1016\/0097-3165(89)90020-4_BIB10","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":"1978","journal-title":"Acta Inform"},{"key":"10.1016\/0097-3165(89)90020-4_BIB11","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/TIT.1983.1056705","article-title":"A new structured design method for convolutions over finite fields, Part I","volume":"IM-29","author":"Wagh","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0097-3165(89)90020-4_BIB12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1090\/S0025-5718-1978-0468306-4","article-title":"On computing the discrete Fourier transform","volume":"32","author":"Winograd","year":"1978","journal-title":"Math. Comp."},{"key":"10.1016\/0097-3165(89)90020-4_BIB13","series-title":"Arithmetic Complexity of Computations","author":"Winograd","year":"1980"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316589900204?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316589900204?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T08:26:22Z","timestamp":1548750382000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316589900204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["0097316589900204"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(89)90020-4","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}