{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T06:25:23Z","timestamp":1747895123392,"version":"3.37.3"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001692","name":"Croucher Foundation","doi-asserted-by":"crossref","award":["9500015"],"award-info":[{"award-number":["9500015"]}],"id":[{"id":"10.13039\/501100001692","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Research Grants Council University Grants Committee","award":["111913"],"award-info":[{"award-number":["111913"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/tc.2018.2811466","type":"journal-article","created":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T19:18:08Z","timestamp":1520363888000},"page":"1-1","source":"Crossref","is-referenced-by-count":3,"title":["FFT-based McLaughlin's Montgomery Exponentiation without Conditional Selections"],"prefix":"10.1109","author":[{"given":"Wangchen","family":"DAI","sequence":"first","affiliation":[]},{"given":"Donald Donglong","family":"CHEN","sequence":"additional","affiliation":[]},{"given":"Ray","family":"Cheung","sequence":"additional","affiliation":[]},{"given":"Cetin Kaya","family":"Koc","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.247"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2013.6670320"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.800-56Br1"},{"key":"ref32","first-page":"291","article-title":"The Montgomery powering ladder","author":"joye","year":"2003","journal-title":"Proc Workshop Cryptographic Hardware Embedded Syst"},{"article-title":"Multidigit multiplication for mathematicians","year":"0","author":"bernstein","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1986-0856713-1"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2014.2355854"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.mejo.2017.03.009"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1049\/ip-cdt:20040791"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2008.2000524"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2307\/2007970"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2015.1119269"},{"key":"ref11","first-page":"3","article-title":"Schnelle multiplikation großer zahlen","volume":"7","author":"sch\u00f6nhage","year":"1971","journal-title":"IEEE Comput"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/070711761"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2016.03.001"},{"key":"ref14","article-title":"Fast arithmetic for faster integer multiplication","author":"covanov","year":"2015","journal-title":"CoRR"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1084"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2622693"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2016.2601334"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-03-01543-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2005.21"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.2307\/2004932"},{"article-title":"High-speed RSA implementation","year":"1994","author":"ko\u00e7","key":"ref4"},{"key":"ref27","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":"ref3","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.800-57p1r3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2010.2080653"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45760-7_3"},{"key":"ref5","volume":"2","author":"knuth","year":"1981","journal-title":"The Art of Computer Programming Seminumerical Algorithms"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1969-0249212-8"},{"key":"ref7","first-page":"293","article-title":"Multiplication of many-digital numbers by automatic computers","volume":"145","author":"karatsuba","year":"1962","journal-title":"Doklady Akad Nauk SSSR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"ref9","first-page":"1","article-title":"Design of an 8,192-bit RSA cryptoprocessor based on systolic\n architecture","author":"renter\u00eda-mej\u00eda","year":"2012","journal-title":"Proc Southern Conf Programmable Logic"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2007.34"},{"key":"ref22","first-page":"167","article-title":"A practical implementation of the timing attack","author":"dhem","year":"1998","journal-title":"Proc Int Conf Research in Smart Cards"},{"key":"ref21","first-page":"104","article-title":"Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and\n other systems","author":"kocher","year":"1996","journal-title":"Proc 16th Annu Int Cryptology Conf Adv Cryptology"},{"key":"ref24","first-page":"192","article-title":"Distinguishing exponent digits by observing modular subtractions","author":"walter","year":"2001","journal-title":"Proc Topics in Cryptology"},{"key":"ref23","first-page":"109","article-title":"A timing attack against RSA with the chinese remainder theorem","author":"schindler","year":"2000","journal-title":"Proc Workshop Cryptographic Hardware Embedded Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1994-1185244-1"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1049\/el:19991230"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/4358213\/08307235.pdf?arnumber=8307235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T13:36:48Z","timestamp":1643204208000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8307235\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/tc.2018.2811466","relation":{},"ISSN":["0018-9340"],"issn-type":[{"type":"print","value":"0018-9340"}],"subject":[],"published":{"date-parts":[[2018]]}}}