{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:58:19Z","timestamp":1740131899273,"version":"3.37.3"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF\/SRC STARSS (1526695)"],"award-info":[{"award-number":["NSF\/SRC STARSS (1526695)"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2016,11,1]]},"DOI":"10.1109\/tc.2016.2543228","type":"journal-article","created":{"date-parts":[[2016,3,17]],"date-time":"2016-03-17T18:19:11Z","timestamp":1458238751000},"page":"3239-3250","source":"Crossref","is-referenced-by-count":2,"title":["A Matrix Decomposition Method for Optimal Normal Basis Multiplication"],"prefix":"10.1109","volume":"65","author":[{"given":"Can","family":"Kizilkale","sequence":"first","affiliation":[]},{"given":"Omer","family":"Egecioglu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2572-9565","authenticated-orcid":false,"given":"Cetin Kaya","family":"Koc","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/12.902754"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1004590"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF00125200"},{"article-title":"Normal bases over finite fields","year":"1993","author":"gao","key":"ref13"},{"key":"ref14","first-page":"61","article-title":"Reducing the complexity of normal basis multiplication","volume":"9061","author":"e?ecio?lu","year":"2014","journal-title":"Arithmetic of Finite Fields"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1201\/9781420034981"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/12.156539"},{"key":"ref17","first-page":"297","article-title":"VLSI architectures for multiplication over finite field GF $(2^m)$","author":"mastrovito","year":"0","journal-title":"International Conference on Applied Algebra Algebraic Algorithms and Error-Correcting Codes"},{"article-title":"VLSI architectures for computation in Galois fields","year":"1991","author":"mastrovito","key":"ref18"},{"article-title":"Efficient VLSI architectures for bit parallel computation in Galois fields","year":"1994","author":"paar","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2323062"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85053-3_16"},{"journal-title":"Digital Signature Standard (DSS)","year":"2009","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s102070100002"},{"article-title":"Computational method and apparatus for finite field arithmetic","year":"1986","author":"omura","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.22"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13039-2_23"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/12.257715"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90090-X"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3198-2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/12.660172"},{"journal-title":"Theory and Practice of Error Control Codes","year":"1983","author":"blahut","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/12.508323"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/12.859542"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/12.769434"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90090-X"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(89)90001-2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2409833"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.10"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7585044\/07435272.pdf?arnumber=7435272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:11:33Z","timestamp":1642003893000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7435272\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,1]]},"references-count":29,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tc.2016.2543228","relation":{},"ISSN":["0018-9340"],"issn-type":[{"type":"print","value":"0018-9340"}],"subject":[],"published":{"date-parts":[[2016,11,1]]}}}