{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T19:19:31Z","timestamp":1769195971863,"version":"3.49.0"},"reference-count":16,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1998,7]]},"DOI":"10.1109\/12.709376","type":"journal-article","created":{"date-parts":[[2002,8,24]],"date-time":"2002-08-24T20:54:49Z","timestamp":1030222489000},"page":"766-776","source":"Crossref","is-referenced-by-count":102,"title":["An RNS Montgomery modular multiplication algorithm"],"prefix":"10.1109","volume":"47","author":[{"given":"J.-C.","family":"Bajard","sequence":"first","affiliation":[]},{"given":"L.-S.","family":"Didier","sequence":"additional","affiliation":[]},{"given":"P.","family":"Kornerup","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"bibt076610","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"bibt07669","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1995.465359"},{"key":"bibt07668","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34799-2_18"},{"key":"bibt07667","doi-asserted-by":"publisher","DOI":"10.2307\/2007970"},{"key":"bibt076612","author":"szabo","year":"1967","journal-title":"Residue Arithmetic and its Application to Computer Technology"},{"key":"bibt07666","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1993.378082"},{"key":"bibt076611","doi-asserted-by":"publisher","DOI":"10.1109\/12.16508"},{"key":"bibt076614","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1993.378083"},{"key":"bibt07665","author":"knuth","year":"1981","journal-title":"Seminumerical Algorithms vol 2 of The Art of Computer Programming"},{"key":"bibt076613","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1993.378085"},{"key":"bibt07664","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1989.72828"},{"key":"bibt07663","first-page":"186","article-title":"how to prove yourself: practical solutions to identification and signature problems","author":"fiat","year":"1986","journal-title":"Advances in Cryptology?Proc Crypto 86"},{"key":"bibt076616","doi-asserted-by":"publisher","DOI":"10.1109\/12.210181"},{"key":"bibt07662","doi-asserted-by":"publisher","DOI":"10.1109\/12.277287"},{"key":"bibt076615","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1984.1659138"},{"key":"bibt07661","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34805-0_34"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx4\/12\/15376\/00709376.pdf?arnumber=709376","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T19:07:15Z","timestamp":1638212835000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/709376\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,7]]},"references-count":16,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/12.709376","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1998,7]]}}}