{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:59:48Z","timestamp":1759147188792,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Research Grant Council of the Hong Kong","award":["CityU 123612","CityU 111913"],"award-info":[{"award-number":["CityU 123612","CityU 111913"]}]},{"DOI":"10.13039\/501100001692","name":"Croucher Startup Allowance","doi-asserted-by":"publisher","award":["9500015"],"award-info":[{"award-number":["9500015"]}],"id":[{"id":"10.13039\/501100001692","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2016,1,1]]},"DOI":"10.1109\/tc.2015.2417553","type":"journal-article","created":{"date-parts":[[2015,3,29]],"date-time":"2015-03-29T02:45:19Z","timestamp":1427597119000},"page":"147-160","source":"Crossref","is-referenced-by-count":19,"title":["Parameter Space for the Architecture of FFT-Based Montgomery Modular Multiplication"],"prefix":"10.1109","volume":"65","author":[{"given":"Donald Donglong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Gavin Xiaoxu","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Ray C.C.","family":"Cheung","sequence":"additional","affiliation":[]},{"given":"Derek","family":"Pao","sequence":"additional","affiliation":[]},{"given":"Cetin Kaya","family":"Koc","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2014.2350431"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2010.5681440"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1976.1162806"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2003.811439"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.247"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.218"},{"key":"ref12","first-page":"595","article-title":"Multiplication of multidigit numbers on automata","volume":"7","author":"karatsuba","year":"1963","journal-title":"Soviet Phys Doklady"},{"article-title":"On the minimum computation time of functions","year":"1966","author":"cook","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242355"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250800"},{"year":"0","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2010.89"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2012.14"},{"key":"ref19","first-page":"123","article-title":"Spectral modular exponentiation","author":"ko\u00e7","year":"0","journal-title":"Proc Conf Computer Arithmetic"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2010.87"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1228516"},{"article-title":"ECRYPT II yearly report on algorithms and keysizes (2011–2012)","year":"2012","author":"smart","key":"ref27"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","article-title":"Modular multiplication without trial division","volume":"44","author":"l","year":"1985","journal-title":"Math Comput"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2005.21"},{"year":"2001","author":"bernstein","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1049\/ip-cdt:20040791"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2013.20"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1084"},{"year":"2012","key":"ref2","article-title":"Recommendation for key management"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.72"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public-key cryptosystems","volume":"21","author":"l","year":"1978","journal-title":"Commun ACM"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/40.502403","article-title":"Analyzing and comparing Montgomery multiplication algorithms","volume":"16","author":"ko\u00e7","year":"1996","journal-title":"IEEE Micro"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1986-0856713-1"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1090\/S0025-5718-03-01543-6","article-title":"New frameworks for Montgomery's modular multiplication method","volume":"73","author":"b","year":"2003","journal-title":"Math Comput"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2307\/2004932"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"1831","DOI":"10.1049\/el:19991230","article-title":"Montgomery exponentiation needs no final subtractions","volume":"35","author":"d","year":"1999","journal-title":"Electron Lett"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-81897-4","author":"nussbaumer","year":"1982","journal-title":"Fast Fourier Transform and Convolution Algorithms"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7350319\/7070700.pdf?arnumber=7070700","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:57:35Z","timestamp":1642003055000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7070700\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,1]]},"references-count":33,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tc.2015.2417553","relation":{},"ISSN":["0018-9340"],"issn-type":[{"type":"print","value":"0018-9340"}],"subject":[],"published":{"date-parts":[[2016,1,1]]}}}