{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:10:58Z","timestamp":1761581458181},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Research Grant Council"},{"name":"Hong Kong Special Administrative Region, China","award":["CityU 111913","CityU 123612"],"award-info":[{"award-number":["CityU 111913","CityU 123612"]}]},{"name":"Croucher Statup Allowance","award":["9500015"],"award-info":[{"award-number":["9500015"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2017,3,1]]},"DOI":"10.1109\/tc.2016.2601334","type":"journal-article","created":{"date-parts":[[2016,8,19]],"date-time":"2016-08-19T18:24:26Z","timestamp":1471631066000},"page":"375-388","source":"Crossref","is-referenced-by-count":17,"title":["Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication"],"prefix":"10.1109","volume":"66","author":[{"given":"Wangchen","family":"Dai","sequence":"first","affiliation":[]},{"given":"Donald Donglong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Ray C. C.","family":"Cheung","sequence":"additional","affiliation":[]},{"given":"Cetin Kaya","family":"Koc","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2013.2283674"},{"key":"ref30","article-title":"Multidigit multiplication for mathematicians","author":"bernstein","year":"0"},{"key":"ref10","article-title":"Fast arithmetic for faster integer multiplication","author":"covanov","year":"2015","journal-title":"CoRR"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1228516"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.72"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cdt.2015.0055"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.247"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2010.89"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2012.14"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1084"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2417553"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2013.6670320"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1986-0856713-1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2307\/2007970"},{"key":"ref27","article-title":"ECRYPT II yearly report on algorithms and keysizes (2011–2012)","author":"smart","year":"2012"},{"key":"ref3","article-title":"Recommendation for key management","year":"0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1969-0249212-8"},{"key":"ref29","first-page":"158","article-title":"Efficient VLSI implementation of modulo (2 $^n\\pm$ 1) addition and multiplication","author":"zimmermann","year":"0","journal-title":"Proc 14th IEEE Symp Comput Arithmetic"},{"key":"ref5","article-title":"Multiplication of multidigit numbers on automata","volume":"7","author":"karatsuba","year":"1963","journal-title":"Soviet Physics Doklady"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/070711761"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242355"},{"key":"ref2","first-page":"14","article-title":"A description of a single-chip implementation of the RSA cipher","volume":"1","author":"rivest","year":"1980","journal-title":"Lambda"},{"key":"ref9","article-title":"Even faster integer multiplication","author":"harvey","year":"2014","journal-title":"CoRR"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2005.21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-03-01543-6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2007.34"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-81897-4","author":"nussbaumer","year":"1982","journal-title":"Fast Fourier Transform and Convolution Algorithms"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1994-1185244-1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.92"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2307\/2004932"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7847504\/07547917.pdf?arnumber=7547917","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:38:32Z","timestamp":1642005512000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7547917\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,1]]},"references-count":31,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tc.2016.2601334","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[2017,3,1]]}}}