{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:11:59Z","timestamp":1742393519015,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,10]]},"DOI":"10.1109\/iccd.2007.4601926","type":"proceedings-article","created":{"date-parts":[[2008,8,21]],"date-time":"2008-08-21T15:14:39Z","timestamp":1219331679000},"page":"368-375","source":"Crossref","is-referenced-by-count":1,"title":["Detecting errors in a polynomial basis multiplier using multiple parity bits for both inputs"],"prefix":"10.1109","author":[{"given":"Siavash","family":"Bayat-Saramdi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.A.","family":"Hasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/TEST.1994.527990"},{"year":"1989","author":"rao","journal-title":"Error-control coding for computer systems","key":"ref11"},{"key":"ref12","first-page":"515","article-title":"Error detection in polynomial basis multipliers over binary extension fields","author":"reyhani-masoleh","year":"2002","journal-title":"Proc Int'l CHES Workshop"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TC.2006.147"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/9780470546345"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/TIT.1985.1057074"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1049\/el:20020468"},{"key":"ref6","first-page":"196","article-title":"Robust finite field arithmetic for fault-tolerant public-key cryptography","author":"gaubatz","year":"2006","journal-title":"Proc Workshop FTDC"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1023\/A:1008333132366"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TCAD.2005.855980"},{"key":"ref7","first-page":"173","article-title":"Non-linear residue codes for robust public-key arithmetic","author":"gaubatz","year":"2006","journal-title":"Proc FTDC Workshop"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TC.2003.1190590","volume":"52","author":"bertoni","year":"2003","journal-title":"IEEE Trans Comp"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/TVLSI.2007.893659"},{"key":"ref9","article-title":"The Galois\/Counter mode of operation (GCM)","author":"mcgrew","year":"2005","journal-title":"NIST Modes Operation Symmetric Key Block Ciphers"}],"event":{"name":"2007 25th International Conference on Computer Design ICCD 2007","start":{"date-parts":[[2007,10,7]]},"location":"Lake Tahoe, CA, USA","end":{"date-parts":[[2007,10,10]]}},"container-title":["2007 25th International Conference on Computer Design"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4591423\/4601871\/04601926.pdf?arnumber=4601926","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T11:08:17Z","timestamp":1497784097000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4601926\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/iccd.2007.4601926","relation":{},"subject":[],"published":{"date-parts":[[2007,10]]}}}