{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T12:49:00Z","timestamp":1750682940870},"reference-count":30,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Electron. Express"],"published-print":{"date-parts":[[2022,5,10]]},"DOI":"10.1587\/elex.19.20220101","type":"journal-article","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T22:10:33Z","timestamp":1648505433000},"page":"20220101-20220101","source":"Crossref","is-referenced-by-count":7,"title":["FPGA-based high-throughput Montgomery modular multipliers for RSA cryptosystems"],"prefix":"10.1587","volume":"19","author":[{"given":"Hao","family":"Xiao","sequence":"first","affiliation":[{"name":"School of Microelectronics, Hefei University of Technology"}]},{"given":"Sijia","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Microelectronics, Hefei University of Technology"}]},{"given":"Biqian","family":"Cheng","sequence":"additional","affiliation":[{"name":"School of Microelectronics, Hefei University of Technology"}]},{"given":"Guangzhu","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Microelectronics, Hefei University of Technology"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] S. Kumar: \u201cPublic key cryptographic system using mandelbrot sets,\u201d IEEE MILCOM (2006) 1 (DOI: 10.1109\/MILCOM.2006.302396).","DOI":"10.1109\/MILCOM.2006.302396"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] S. Kuang, <i>et al.<\/i>: \u201cEnergy-efficient high-throughput Montgomery modular multipliers for RSA cryptosystems,\u201d IEEE Trans. Very Large Scale Integr. (VLSI) Syst. <b>21<\/b> (2013) 1999 (DOI: 10.1109\/TVLSI.2012.2227846).","DOI":"10.1109\/TVLSI.2012.2227846"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] P.L. Montgomery: \u201cModular multiplication without trial division,\u201d Math. Comput. <b>44<\/b> (1985) 519 (DOI: 10.1090\/s0025-5718-1985-0777282-x).","DOI":"10.1090\/S0025-5718-1985-0777282-X"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] J. Ding and S. Li: \u201cA low-latency and low-cost Montgomery modular multiplier based on NLP multiplication,\u201d IEEE Trans. Circuits Syst. II, Exp. Briefs <b>67<\/b> (2020) 1319 (DOI: 10.1109\/TCSII.2019.2932328).","DOI":"10.1109\/TCSII.2019.2932328"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Z. Gu and S. Li: \u201cA division-free toom-cook multiplication-based Montgomery modular multiplication,\u201d IEEE Trans. Circuits Syst. II, Exp. Briefs <b>66<\/b> (2019) 1401 (DOI: 10.1109\/TCSII.2018.2886962).","DOI":"10.1109\/TCSII.2018.2886962"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] S. Khan, <i>et al.<\/i>: \u201cHigh-speed FPGA implementation of full-word Montgomery multiplier for ECC applications,\u201d Microprocessors Microsy. <b>62<\/b> (2018) 91 (DOI: 10.1016\/j.micpro.2018.07.005).","DOI":"10.1016\/j.micpro.2018.07.005"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] M. Huang, <i>et al<\/i>.: \u201cNew hardware architectures for Montgomery modular multiplication algorithm,\u201d IEEE Trans. Comput. <b>60<\/b> (2011) 923 (DOI: 10.1109\/TC.2010.247).","DOI":"10.1109\/TC.2010.247"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] S. Kuang, <i>et al.<\/i>: \u201cLow-cost high-performance VLSI architecture for Montgomery modular multiplication,\u201d IEEE Trans. Very Large Scale Integr. (VLSI) Syst. <b>24<\/b> (2016) 434 (DOI: 10.1109\/TVLSI.2015.2409113<i><\/i>).","DOI":"10.1109\/TVLSI.2015.2409113"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] S.H. Choi, <i>et al.<\/i>: \u201cEnhancement of a modified radix-2 Montgomery modular multiplication,\u201d IEICE Electron. Express <b>11<\/b> (2014) 1 (DOI: 10.1587\/elex.11.20140782).","DOI":"10.1587\/elex.11.20140782"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] K. Manochehri, <i>et al.<\/i>: \u201cA modified radix-2 Montgomery modular multiplication with new recoding method,\u201d IEICE Electron. Express <b>7<\/b> (2010) 513 (DOI: 10.1587\/elex.7.513).","DOI":"10.1587\/elex.7.513"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] R.B. Nti and K. Ryoo: \u201cArea-efficient design of modular exponentiation using Montgomery multiplier for RSA cryptosystem,\u201d Lecture Notes in Electrical Engineering <b>518<\/b> (2018) (DOI: 10.1007\/978-981-13-1328-8_56).","DOI":"10.1007\/978-981-13-1328-8_56"},{"key":"12","unstructured":"[12] G. Todorov and A. Tenca: \u201cAsic design, implementation and analysis of a scalable high-radix montgomery multiplier,\u201d Master\u2019s Thesis, Oregon State University, USA (2008)."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] A. Rezai and P. Keshavarzi: \u201cHigh-throughput Modular multiplication and exponentiation algorithms using multibit-scan-multibit-shift technique,\u201d IEEE Trans. Very Large Scale Integr. (VLSI) Syst. <b>23<\/b> (2015) 1710 (DOI: 10.1109\/TVLSI.2014.2355854).","DOI":"10.1109\/TVLSI.2014.2355854"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] S.S. Erdem, <i>et al.<\/i>: \u201cA general digit-serial architecture for Montgomery modular multiplication,\u201d IEEE Trans. Very Large Scale Integr. (VLSI) Syst. <b>25<\/b> (2017) 1658 (DOI: 10.1109\/TVLSI.2017.2652979).","DOI":"10.1109\/TVLSI.2017.2652979"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] B. Zhang, <i>et al.<\/i>: \u201cHigh-radix design of a scalable Montgomery modular multiplier with low latency,\u201d IEEE Trans. Comput. <b>71<\/b> (2022) 436 (DOI: 10.1109\/TC.2021.3052999).","DOI":"10.1109\/TC.2021.3052999"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] P. Wang, <i>et al.<\/i>: \u201cHigh radix Montgomery modular multiplier on modern FPGA,\u201d IEEE Int. Conf. Trust, Security and Privacy Computing and Communications (2013) 1484 (DOI: 10.1109\/TrustCom.2013.180).","DOI":"10.1109\/TrustCom.2013.180"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] H. Xiao, <i>et al.<\/i>: \u201cAlgorithm-hardware co-design of ultra-high radix based high throughput modular multiplier,\u201d IEICE Electron. Express <b>18<\/b> (2021) 20210135 (DOI: 10.1587\/elex.18.20210135).","DOI":"10.1587\/elex.18.20210135"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] A. Miyamoto, <i>et al.<\/i>: \u201cSystematic design of RSA processors based on high-radix Montgomery multipliers,\u201d IEEE Trans. Very Large Scale Integr. (VLSI) Syst. <b>19<\/b> (2010) 1136 (DOI: 10.1109\/TVLSI.2010.2049037).","DOI":"10.1109\/TVLSI.2010.2049037"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] T. Blum and C. Paar: \u201cHigh-radix Montgomery modular exponentiation on reconfigurable hardware,\u201d IEEE Trans. Comput. <b>50<\/b> (2001) 759 (DOI: 10.1109\/12.936241).","DOI":"10.1109\/12.936241"},{"key":"20","unstructured":"[20] J. Yuan, <i>et al.<\/i>: \u201cCritical path extract oriented maximum operating frequency testing method for sequential circuit in FPGA,\u201d J. Fudan Univ. <b>54<\/b> (2015) 706 (DOI: 10.15943\/j.cnki.fdxb-jns.2015.06.004)."},{"key":"21","unstructured":"[21] H. Orup: \u201cSimplifying quotient determination in high-radix modular multiplication,\u201d Symp. Comput. Arithmetic (1995) 193 (DOI: 10.1109\/ARITH.1995.465359)."},{"key":"22","unstructured":"[22] Xilinx: ug579.pdf (2021) https:\/\/www.xilinx.com"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] C. Couvreur and J. Quisquater: \u201cFast decipherment algorithm for RSA public-key cryptosystem,\u201d Elect. Lett. <b>18<\/b> (1982) 905 (DOI: 10.1049\/el: 19820617).","DOI":"10.1049\/el:19820617"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] G.D. Sutter, <i>et al.<\/i>: \u201cModular multiplication and exponentiation architectures for fast RSA cryptosystem based on digit serial computation,\u201d IEEE Trans. Ind. Electron. <b>58<\/b> (2011) 3101 (DOI: 10.1109\/TIE.2010.2080653).","DOI":"10.1109\/TIE.2010.2080653"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] R. Liu and S. Li: \u201cA design and implementation of Montgomery modular multiplier,\u201d IEEE ISCAS (2019) 1 (DOI: 10.1109\/ISCAS.2019.8702684).","DOI":"10.1109\/ISCAS.2019.8702684"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] X. Yan, <i>et al.<\/i>: \u201cAn implementation of Montgomery modular multiplication on FPGAs,\u201d Int. Conf. Inf. Sci. Cloud Comput. (2013) 32 (DOI: 10.1109\/ISCC.2013.19).","DOI":"10.1109\/ISCC.2013.19"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] A.A.H. Abd-Elkader, <i>et al.<\/i>: \u201cFPGA-based optimized design of Montgomery modular multiplier,\u201d IEEE Trans. Circuits Syst. II, Exp. Briefs <b>68<\/b> (2021) 2137 (DOI: 10.1109\/TCSII.2020.3040665).","DOI":"10.1109\/TCSII.2020.3040665"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] D. Amiet, <i>et al.<\/i>: \u201cFlexible FPGA-based architectures for curve point multiplication over GF(p),\u201d IEEE DSD (2016) 107 (DOI: 10.1109\/DSD.2016.70).","DOI":"10.1109\/DSD.2016.70"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] G.D. Sutter, <i>et al.<\/i>: \u201cModular multiplication and exponentiation architectures for fast RSA cryptosystem based on digit serial computation,\u201d IEEE Trans. Ind. Electron. <b>58<\/b> (2011) 3101 (DOI: 10.1109\/TIE.2010.2080653).","DOI":"10.1109\/TIE.2010.2080653"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] I. San and N. At: \u201cImproving the computational efficiency of modular operations for embedded systems,\u201d J. Syst. Architect. <b>60<\/b> (2014) 440 (DOI: 10.1016\/j.sysarc.2013.10.013).","DOI":"10.1016\/j.sysarc.2013.10.013"}],"container-title":["IEICE Electronics Express"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/elex\/19\/9\/19_19.20220101\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T04:52:38Z","timestamp":1652503958000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/elex\/19\/9\/19_19.20220101\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,10]]},"references-count":30,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/elex.19.20220101","relation":{},"ISSN":["1349-2543"],"issn-type":[{"value":"1349-2543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,10]]},"article-number":"19.20220101"}}