{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T08:42:16Z","timestamp":1770540136809,"version":"3.49.0"},"reference-count":30,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Electron. Express"],"published-print":{"date-parts":[[2021,5,25]]},"DOI":"10.1587\/elex.18.20210135","type":"journal-article","created":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T22:07:41Z","timestamp":1619474861000},"page":"20210135-20210135","source":"Crossref","is-referenced-by-count":4,"title":["Algorithm-hardware co-design of ultra-high radix based high throughput modular multiplier"],"prefix":"10.1587","volume":"18","author":[{"given":"Hao","family":"Xiao","sequence":"first","affiliation":[{"name":"School of Microelectronics, Hefei University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxuan","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Microelectronics, Hefei University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenmin","family":"Li","sequence":"additional","affiliation":[{"name":"School of Microelectronics, Hefei University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangzhu","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Microelectronics, Hefei University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] R.L. Rivest, <i>et al.<\/i>: \u201cA method for obtaining digital signatures and public-key cryptosystems,\u201d Commun. ACM <b>21<\/b> (1978) 120 (DOI: 10.1145\/359340.359342).","DOI":"10.1145\/359340.359342"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] K. Neal: \u201cElliptic curve cryptosystems,\u201d Math. Comput. <b>48<\/b> (1987) 203 (DOI: 10.1090\/S0025-5718-1987-0866109-5).","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] V.S. Miller: \u201cUse of elliptic curves in cryptography,\u201d Lect. Notes Comput. Sci. (1985) 417 (DOI: 10.1007\/3-540-39799-X_31).","DOI":"10.1007\/3-540-39799-X_31"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] M.D. Shieh, <i>et al.<\/i>: \u201cA New Modular Exponentiation Architecture for Efficient Design of RSA Cryptosystem,\u201d IEEE Trans. Very Large Scale Integr. (VLSI) Syst. <b>16<\/b> (2008) 1151 (DOI: 10.1109\/TVLSI.2008.2000524).","DOI":"10.1109\/TVLSI.2008.2000524"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] 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":"6","doi-asserted-by":"crossref","unstructured":"[6] N. Nedjah, <i>et al.<\/i>: \u201cMassively parallel modular exponentiation method and its implementation in software and hardware for high-performance cryptographic systems,\u201d IET Comput. Digital Tech. <b>6<\/b> (2012) 290 (DOI: 10.1049\/iet-cdt.2011.0074).","DOI":"10.1049\/iet-cdt.2011.0074"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] J. Wei, <i>et al.<\/i>: \u201cA low-time-complexity and secure dual-field scalar multiplication based on co-Z protected NAF,\u201d IEICE Electron. Express <b>11<\/b> (2014) 20140361 (DOI: 10.1587\/elex.11.20140361).","DOI":"10.1587\/elex.11.20140361"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] X. Han, <i>et al.<\/i>: \u201cA high-performance elliptic curve cryptographic coprocessor with side channel analysis countermeasures for smart IC card,\u201d IEICE Electron. Express <b>12<\/b> (2015) 20150470 (DOI: 0.1587\/elex.12.20150470).","DOI":"10.1587\/elex.12.20150470"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] T.F. Al-Somani: \u201cVery efficient point multiplication on Koblitz curves,\u201d IEICE Electron. Express <b>13<\/b> (2016) 20160044 (DOI: 10.1587\/elex.13.20160044).","DOI":"10.1587\/elex.13.20160044"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] M. Mehrabi, <i>et al.<\/i>: \u201cElliptic curve cryptography point multiplication core for hardware security module,\u201d IEEE Trans. Comput. <b>69<\/b> (2020) 1707 (DOI: 10.1109\/TC.2020.3013266).","DOI":"10.1109\/TC.2020.3013266"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] L.M. Peter: \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":"12","doi-asserted-by":"crossref","unstructured":"[12] G.R. Blakely: \u201cA computer algorithm for calculating the product AB modulo M,\u201d IEEE Trans. Comput. <b>C-32<\/b> (1983) 497 (DOI: 10.1109\/TC.1983.1676262).","DOI":"10.1109\/TC.1983.1676262"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] M. Kne\u017eevi\u0107, <i>et al.<\/i>: \u201cLow-latency ECDSA signature verification--a road toward safer traffic,\u201d IEEE Trans. Very Large Scale Integr. (VLSI) Syst. <b>24<\/b> (2016) 3257 (DOI: 10.1109\/TVLSI.2016.2557965).","DOI":"10.1109\/TVLSI.2016.2557965"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] J. Ding, <i>et al.<\/i>: \u201cHigh-speed ECC processor over NIST prime fields applied with Toom-Cook multiplication,\u201d IEEE Trans. Circuits Syst. I, Reg. Papers <b>66<\/b> (2019) 1003 (DOI: 10.1109\/TCSI.2018.2878598).","DOI":"10.1109\/TCSI.2018.2878598"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] J. Ding and S. Li: \u201cA reconfigurable high-speed ECC processor over NIST primes,\u201d IEEE Int. Conf. Trust, Secur. Priv. Comput. Commun. (2017) 1064 (DOI: 10.1109\/Trustcom\/BigDataSE\/ICESS.2017.353).","DOI":"10.1109\/Trustcom\/BigDataSE\/ICESS.2017.353"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] P. Choi, <i>et al.<\/i>: \u201cLow-complexity elliptic curve cryptography processor based on configurable partial modular reduction over NIST prime fields,\u201d IEEE Trans. Circuits Syst. II, Exp. Briefs <b>65<\/b> (2018) 1703 (DOI: 10.1109\/TCSII.2017.2756680).","DOI":"10.1109\/TCSII.2017.2756680"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] H. Marzouqi, <i>et al.<\/i>: \u201cA high-speed FPGA implementation of an RSD-based ECC processor,\u201d IEEE Trans. Very Large Scale Integr. (VLSI) Syst. <b>24<\/b> (2016) 151 (DOI: 10.1109\/TVLSI.2015.2391274).","DOI":"10.1109\/TVLSI.2015.2391274"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] G. Gallin and A. Tisserand: \u201cGeneration of finely-pipelined GF(<i>P<\/i>) multipliers for flexible curve based cryptography on FPGAs,\u201d IEEE Trans. Comput. <b>68<\/b> (2019) 1612 (DOI: 10.1109\/TC.2019.2920352).","DOI":"10.1109\/TC.2019.2920352"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] B. Koziel, <i>et al.<\/i>: \u201cPost-quantum cryptography on FPGA based on isogenies on elliptic curves,\u201d IEEE Trans. Circuits Syst. I, Reg. Papers <b>64<\/b> (2017) 86 (DOI: 10.1109\/TCSI.2016.2611561).","DOI":"10.1109\/TCSI.2016.2611561"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] D. Mukhopadhyay and D.B. Roy: \u201cRevisiting FPGA implementation of Montgomery multiplier in redundant number system for efficient ECC application in GF(p),\u201d Int. Conf. Field Program. Log. Appl. (2018) 323 (DOI: 10.1109\/FPL.2018.00061).","DOI":"10.1109\/FPL.2018.00061"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] D.B. Roy and D. Mukhopadhyay: \u201cHigh-speed implementation of ECC scalar multiplication in GF(p) for generic Montgomery curves,\u201d IEEE Trans. Very Large Scale Integr. (VLSI) Syst. <b>27<\/b> (2019) 1587 (DOI: 10.1109\/TVLSI.2019.2905899).","DOI":"10.1109\/TVLSI.2019.2905899"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] S. Ghosh, <i>et al.<\/i>: \u201cPetrel: power and timing attack resistant elliptic curve scalar multiplier based on programmable GF(<i>p<\/i>) arithmetic unit,\u201d IEEE Trans. Circuits Syst. I, Reg. Papers <b>58<\/b> (2011) 1798 (DOI: 10.1109\/TCSI.2010.2103190).","DOI":"10.1109\/TCSI.2010.2103190"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] M.S. Hossain, <i>et al.<\/i>: \u201cHigh-performance elliptic curve cryptography processor over NIST prime fields,\u201d IET Comput. Digital Tech. <b>11<\/b> (2017) 33 (DOI: 10.1049\/iet-cdt.2016.0033).","DOI":"10.1049\/iet-cdt.2016.0033"},{"key":"24","unstructured":"[24] V. Bunimov and M. Schimmler: \u201cArea and time efficient modular multiplication of large integers,\u201d Proc. Int. Conf. Appl. Spec. Syst. Arcitec. and Process. (2003) 400 (DOI: 10.1109\/ASAP.2003.1212863)."},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] Z. Liu, <i>et al.<\/i>: \u201cAn efficient and flexible hardware implementation of the dual-field elliptic curve cryptographic processor,\u201d IEEE Trans. Ind. Electron. <b>64<\/b> (2017) 2353 (DOI: 10.1109\/TIE.2016.2625241).","DOI":"10.1109\/TIE.2016.2625241"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] J.-W. Lee, <i>et al.<\/i>: \u201cEfficient power-analysis-resistant dual-field elliptic curve cryptographic processor using heterogeneous dual-processing-element architecture,\u201d IEEE Trans. Very Large Scale Integr. (VLSI) Syst. <b>22<\/b> (2014) 49 (DOI: 10.1109\/TVLSI.2013.2237930).","DOI":"10.1109\/TVLSI.2013.2237930"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] K. Javeed, <i>et al.<\/i>: \u201cSerial and parallel interleaved modular multipliers on FPGA platform,\u201d Int. Conf. Field Program. Log. Appl. (2015) 1 (DOI: 10.1109\/FPL.2015.7293986).","DOI":"10.1109\/FPL.2015.7293986"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] S. Sinha Roy, <i>et al.<\/i>: \u201cFPGA-based high-performance parallel architecture for homomorphic computing on encrypted data,\u201d Proc. IEEE Int. Symp. High Perform. Comput. Archit. (2019) 387 (DOI: 10.1109\/HPCA.2019.00052).","DOI":"10.1109\/HPCA.2019.00052"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] E. \u00d6zt\u00fcrk: \u201cDesign and implementation of a low-latency modular multiplication algorithm,\u201d IEEE Trans. Circuits Syst. I, Reg. Papers <b>67<\/b> (2020) 1902 (DOI: 10.1109\/TCSI.2020.2966755).","DOI":"10.1109\/TCSI.2020.2966755"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] M.D.M. Islam, <i>et al.<\/i>: \u201cArea-time efficient hardware implementation of modular multiplication for elliptic curve cryptography,\u201d IEEE Access <b>8<\/b> (2020) 73898 (DOI: 10.1109\/ACCESS.2020.2988379).","DOI":"10.1109\/ACCESS.2020.2988379"}],"container-title":["IEICE Electronics Express"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/elex\/18\/10\/18_18.20210135\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T06:17:21Z","timestamp":1623219441000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/elex\/18\/10\/18_18.20210135\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,25]]},"references-count":30,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/elex.18.20210135","relation":{},"ISSN":["1349-2543"],"issn-type":[{"value":"1349-2543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,25]]}}}