{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:18:48Z","timestamp":1780053528020,"version":"3.54.0"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1109\/tsp.2011.2178844","type":"journal-article","created":{"date-parts":[[2011,12,9]],"date-time":"2011-12-09T14:59:36Z","timestamp":1323442776000},"page":"1149-1158","source":"Crossref","is-referenced-by-count":17,"title":["On Algorithms and Complexities of Cyclotomic Fast Fourier Transforms Over Arbitrary Finite Fields"],"prefix":"10.1109","volume":"60","author":[{"given":"Xuebin","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiyuan","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946006020074"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.04.060631"},{"key":"ref12","first-page":"739","article-title":"Fully paramaterisable Galois field arithmetic processor over <formula formulatype=\"inline\"><tex Notation=\"TeX\">${\\hbox{GF}}(3^m)$<\/tex> <\/formula> suitable for elliptic curve cryptography","volume":"2","author":"kerins","year":"2004","journal-title":"Proc 24th Int Microelectron Conf"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2106778"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.2009891"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/49.1926"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(89)90020-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178683"},{"key":"ref18","first-page":"1","article-title":"Arithmetic and factorization of polynomials over <formula formulatype=\"inline\"><tex Notation=\"TeX\">${\\rm F}_2$<\/tex><\/formula>","author":"von zur gathen","year":"1996","journal-title":"Proc Int Symp Algorithms Comput (ISSAC)"},{"key":"ref19","author":"gao","year":"2001","journal-title":"Mathematical Sciences 985 Course Notes"},{"key":"ref28","author":"aho","year":"1974","journal-title":"The Design and Analysis of Computer Algorithms"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICMEL.2004.1314939"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1974.1162532"},{"key":"ref3","first-page":"1255","article-title":"Dual-mode decoding of product codes with application to tape storage","volume":"3","author":"han","year":"2005","journal-title":"Proc IEEE Global Telecommun Conf"},{"key":"ref6","year":"1999","journal-title":"Recommended Elliptic Curves for Federal Government Use"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1515\/crll.2004.048"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2009.2014292"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026171930630"},{"key":"ref7","year":"2000","journal-title":"SEC 2 Recommended elliptic curve domain parameters"},{"key":"ref2","year":"2007","journal-title":"Hard Disk Drive Long Data Sector White Paper"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/ett.982","article-title":"On computing the syndrome polynomial in Reed&#x2013;Solomon decoder","volume":"15","author":"costa","year":"2004","journal-title":"Eur Trans Telecommun"},{"key":"ref1","author":"blahut","year":"1985","journal-title":"Fast Algorithms for Digital Signal Processing"},{"key":"ref20","author":"mateer","year":"2008","journal-title":"Fast Fourier Transform Algorithms With Applications"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.19"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2079016"},{"key":"ref24","author":"lidl","year":"1996","journal-title":"Finite Fields (Encyclopedia of Mathematics and Its Applications)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970364"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TEMC.1971.303141"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1049\/el:19710492"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/78\/6146821\/06097072.pdf?arnumber=6097072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:52:01Z","timestamp":1633909921000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6097072\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":29,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2011.2178844","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3]]}}}