{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:48:43Z","timestamp":1759146523956},"reference-count":16,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/arith.2003.1207678","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T09:34:28Z","timestamp":1079948068000},"page":"188-195","source":"Crossref","is-referenced-by-count":9,"title":["Low complexity sequential normal basis multipliers over GF(2\/sup m\/)"],"prefix":"10.1109","author":[{"given":"A.","family":"Reyhani-Masoleh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.A.","family":"Hasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90090-X"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/12.805153"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1004590"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1109\/ISCAS.2002.1010820","article-title":"Efficient Digit-Serial Normal Basis Multipliers over GF(2M)","author":"reyhani-masoleh","year":"2002","journal-title":"IEEE International Symposium on Circuits and Systems ISCAS 2002"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1190584"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/12.902754"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.1676616"},{"key":"ref4","first-page":"97","article-title":"Improved VLSI Designs for Multiplication and Inversion in GF(2M) over normal bases","author":"gao","year":"2000","journal-title":"Proceedings of 13th Annual IEEE International ASIC\/SOC Conference"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/12.35833"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172769"},{"year":"2000","key":"ref5","article-title":"IEEE Standard Specifications for Public-Key Cryptography"},{"article-title":"VLSI Architectures for Computation in Galois Fields","year":"1991","author":"mastrovito","key":"ref8"},{"key":"ref7","article-title":"Computational Method and Apparatus for Finite Field Arithmetic","author":"massey","year":"1986","journal-title":"US Patent No"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056591"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196789"},{"key":"ref9","article-title":"Multiple Bit Multiplier","author":"mullin","year":"1998","journal-title":"US Patent No"}],"event":{"name":"16th IEEE Symposium on Computer Arithmetic","acronym":"ARITH-03","location":"Santiago de Compostela, Spain"},"container-title":["16th IEEE Symposium on Computer Arithmetic, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8582\/27181\/01207678.pdf?arnumber=1207678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T00:25:56Z","timestamp":1497572756000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1207678\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/arith.2003.1207678","relation":{},"subject":[]}}