{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T02:42:36Z","timestamp":1709347356668},"reference-count":0,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1109\/fdtc.2007.4318982","type":"proceedings-article","created":{"date-parts":[[2007,10,1]],"date-time":"2007-10-01T19:08:25Z","timestamp":1191265705000},"source":"Crossref","is-referenced-by-count":0,"title":["Montgomery Multiplication with Redundancy Check"],"prefix":"10.1109","author":[{"given":"Khanh","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Michael","family":"Tunstall","sequence":"additional","affiliation":[]}],"member":"263","event":{"name":"Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC 2007)","location":"Vienna, Austria","start":{"date-parts":[[2007,9,10]]},"end":{"date-parts":[[2007,9,10]]}},"container-title":["Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC 2007)"],"original-title":[],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T15:57:41Z","timestamp":1602691061000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4318982"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1109\/fdtc.2007.4318982","relation":{},"subject":[],"published":{"date-parts":[[2007,9]]}}}