{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T15:40:16Z","timestamp":1777736416829,"version":"3.51.4"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2022,2,1]]},"DOI":"10.1109\/tc.2021.3052999","type":"journal-article","created":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T20:28:43Z","timestamp":1642105723000},"page":"436-449","source":"Crossref","is-referenced-by-count":26,"title":["High-Radix Design of a Scalable Montgomery Modular Multiplier With Low Latency"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3215-8745","authenticated-orcid":false,"given":"Bo","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeming","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2677-7307","authenticated-orcid":false,"given":"Massoud","family":"Pedram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2307\/2007884"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2046660.2046682"},{"issue":"11","key":"ref4","first-page":"169","article-title":"On data banks and privacy homomorphisms","volume":"4","author":"Rivest","year":"1978","journal-title":"Found. Sec. Comput."},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1090\/s0025-5718-1985-0777282-x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2018.2886962"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.2003.1212863"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2003.1291939"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1228516"},{"key":"ref11","article-title":"Scalable methods and apparatus for Montgomery multiplication","author":"Tenca","year":"2006"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.72"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.247"},{"key":"ref14","article-title":"Montgomery multiplication architecture","author":"Huang","year":"2013"},{"key":"ref15","article-title":"Scalable Montgomery multiplication architecture","author":"Huang","year":"2013"},{"key":"ref16","article-title":"Th\u00e9orie g\u00e9n\u00e1rale des \u00e9quations alg\u00e9briques","author":"B\u00e9zout"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48059-5_9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44499-8_23"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2005.9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.93"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2006.311207"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1284480.1284562"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.2003.1212863"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2006.12.003"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2003.1291939"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1973.5009159"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/qjmam\/4.2.236"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2005.1599950"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IWSOC.2005.111"},{"key":"ref30","article-title":"Parallel computation techniques for accelerated cryptographic capabilities","author":"Satpathy","year":"2019"},{"key":"ref31","article-title":"Montgomery multiplication method","author":"Michael","year":"2015"},{"key":"ref32","article-title":"Scalable, faster method and apparatus for montgomery multiplication","author":"Moshier","year":"2010"},{"key":"ref33","article-title":"Montgomery multiplication method for performing final modular reduction without comparison operation and montgomery multiplier","author":"Jonghoon","year":"2017"},{"key":"ref34","volume-title":"Introduction to Algorithms","author":"Cormen","year":"2009"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2018.06.015"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cds.2018.5182"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cds.2017.0300"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2017.2652979"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2016.70"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cdt.2015.0055"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/9680740\/09328560.pdf?arnumber=9328560","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T22:52:31Z","timestamp":1704840751000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9328560\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,1]]},"references-count":40,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tc.2021.3052999","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,1]]}}}