{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:42:19Z","timestamp":1761648139358},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1109\/tc.2013.2297106","type":"journal-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T17:45:20Z","timestamp":1391190320000},"page":"862-867","source":"Crossref","is-referenced-by-count":7,"title":["$\\schmi{GF(2^n)}$ Shifted Polynomial Basis Multipliers Based on Subquadratic Toeplitz Matrix-Vector Product Approach for All Irreducible Pentanomials"],"prefix":"10.1109","volume":"64","author":[{"given":"Jiangtao","family":"Han","sequence":"first","affiliation":[{"name":"School of Software, Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haining","family":"Fan","sequence":"additional","affiliation":[{"name":"School of Software, Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1049\/ip-e.1992.0036","article-title":"division and bit-serial multiplication over gf(q\/sup m\/)","volume":"139","author":"hasan","year":"1992","journal-title":"Computers and Digital Techniques IEE Proceedings-"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/12.392853"},{"key":"ref12","year":"0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1117\/12.734195"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-011-0654-2"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.276"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.96"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.95"},{"key":"ref18","author":"seroussi","year":"1998","journal-title":"Table of low-weight binary irreducible polynomials"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10440-006-9047-0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2009.0039"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.52"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.46"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_19"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.19"},{"key":"ref7","author":"negre","year":"2012","journal-title":"Efficient Binary Polynomial Multiplication Based on Optimized Karatsuba Reconstruction"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/12.508323"},{"key":"ref1","first-page":"595","article-title":"Multiplication of Multidigit Numbers on Automata","volume":"7","author":"karatsuba","year":"1963","journal-title":"Soviet Physics Doklady (English Translation)"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1109\/TC.2005.64","article-title":"Fast Bit-Parallel ${GF}(2^n)$<\/tex> <\/formula> Multiplier for All Trinomials","volume":"54","author":"fan","year":"2005","journal-title":"IEEE Trans Computers"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85053-3_19"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.146"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.47"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1109\/TC.2012.63","article-title":"Fast Parallel ${GF}(2^m)$<\/tex> <\/formula> Polynomial Multiplication for All Degrees","volume":"62","author":"cilardo","year":"2013","journal-title":"IEEE Trans Computers"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2009.16"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1252850"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/12.859542"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7031983\/06698349.pdf?arnumber=6698349","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,18]],"date-time":"2022-06-18T02:31:50Z","timestamp":1655519510000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6698349\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3]]},"references-count":26,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tc.2013.2297106","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3]]}}}