{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:10:14Z","timestamp":1780675814710,"version":"3.54.1"},"reference-count":20,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T00:00:00Z","timestamp":1728691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>Elliptic curve cryptography (ECC) is widely used for secure communications, because it can provide the same level of security as RSA with a much smaller key size. In constrained environments, it is important to consider efficiency, in terms of execution time and hardware costs. Modular inversion is a key time-consuming calculation used in ECC. Its hardware implementation requires extensive hardware resources, such as lookup tables and registers. We investigate the state-of-the-art modular inversion algorithms, and evaluate the performance and cost of the algorithms and their hardware implementations. We then propose a high-radix modular inversion algorithm aimed at reducing the execution time and hardware costs. We present a detailed radix-8 hardware implementation based on 256-bit primes in Verilog HDL and compare its cost performance to other implementations. Our implementation on the Altera Cyclone V FPGA chip used 1227 ALMs (adaptive logic modules) and 1037 registers. The modular inversion calculation took 3.67 ms. The AT (area\u2013time) factor was 8.30, outperforming the other implementations. We also present an implementation of ECC using the proposed radix-8 modular inversion algorithm. The implementation results also showed that our modular inversion algorithm was more efficient in area\u2013time than the other algorithms.<\/jats:p>","DOI":"10.3390\/computers13100265","type":"journal-article","created":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T05:47:58Z","timestamp":1728884878000},"page":"265","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Area\u2013Time-Efficient High-Radix Modular Inversion Algorithm and Hardware Implementation for ECC over Prime Fields"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0069-5629","authenticated-orcid":false,"given":"Yamin","family":"Li","sequence":"first","affiliation":[{"name":"Computer Architecture Laboratory, Department of Computer Science, Faculty of Computer and Information Sciences, Hosei University, Tokyo 184-8584, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2024,10,12]]},"reference":[{"key":"ref_1","unstructured":"Burton, D. (2011). The History of Mathematics\/An Introduction, McGraw-Hill. [7th ed.]."},{"key":"ref_2","unstructured":"Hankerson, D., Menezes, A., and Vanstone, S. (2004). Guide to Elliptic Curve Cryptography, Springer."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Hossain, M.S., and Kong, Y. (2015, January 11\u201313). High-Performance FPGA Implementation of Modular Inversion over F_256 for Elliptic Curve Cryptography. Proceedings of the 2015 IEEE International Conference on Data Science and Data Intensive Systems, Sydney, Australia.","DOI":"10.1109\/DSDIS.2015.47"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Daly, A., Marnane, W., Kerins, T., and Popovici, E. (2005). Division in GF(p) for Application in Elliptic Curve Cryptosystems on Field Programmable Logic. New Algorithms, Architectures and Applications for Reconfigurable Computing, Springer.","DOI":"10.1007\/1-4020-3128-9_18"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Mrabet, A., El-Mrabet, N., Bouallegue, B., Mesnager, S., and Machhout, M. (2017, January 8\u201310). An efficient and scalable modular inversion\/division for public key cryptosystems. Proceedings of the 2017 International Conference on Engineering & MIS (ICEMIS), Monastir, Tunisia.","DOI":"10.1109\/ICEMIS.2017.8272995"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Chen, C., and Qin, Z. (2009, January 1\u20133). Fast Algorithm and Hardware Architecture for Modular Inversion in GF(p). Proceedings of the 2009 Second International Conference on Intelligent Networks and Intelligent Systems, Tianjin, China.","DOI":"10.1109\/ICINIS.2009.20"},{"key":"ref_7","first-page":"425","article-title":"Efficient Design and Performance Analysis of a Hardware Right-shift Binary Modular Inversion Algorithm in GF(p)","volume":"17","author":"Choi","year":"2017","journal-title":"J. Semicond. Technol. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Wang, D., Lin, Y., Hu, J., Zhang, C., and Zhong, Q. (2023). FPGA Implementation for Elliptic Curve Cryptography Algorithm and Circuit with High Efficiency and Low Delay for IoT Applications. Micromachines, 14.","DOI":"10.3390\/mi14051037"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Yang, D., Dai, Z., Li, W., and Chen, T. (November, January 29). An Efficient ASIC Implementation of Public Key Cryptography Algorithm SM2 Based on Module Arithmetic Logic Unit. Proceedings of the 2019 IEEE 13th International Conference on ASIC (ASICON), Chongqing, China.","DOI":"10.1109\/ASICON47005.2019.8983471"},{"key":"ref_10","unstructured":"Yan, X., and Li, S. (2007, January 22\u201325). Modified modular inversion algorithm for VLSI implementation. Proceedings of the 2007 7th International Conference on ASIC, Guilin, China."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Dong, X., Zhang, L., and Gao, X. (2018, January 16\u201318). An Efficient FPGA Implementation of ECC Modular Inversion over F256. Proceedings of the 2nd International Conference on Cryptography, Security and Privacy, Guiyang, China.","DOI":"10.1145\/3199478.3199491"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Hao, Y., Zhong, S., Ma, M., Jiang, R., Huang, S., Zhang, J., and Wang, W. (2022). Lightweight Architecture for Elliptic Curve Scalar Multiplication over Prime Field. Electronics, 11.","DOI":"10.3390\/electronics11142234"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Guo, K.Y., Fang, W.C., and Fahier, N. (2023, January 21\u201325). An Efficient Hardware Design of Prime Field Modular Inversion\/Division for Public Key Cryptography. Proceedings of the 2023 IEEE International Symposium on Circuits and Systems (ISCAS), Monterey, CA, USA.","DOI":"10.1109\/ISCAS46773.2023.10181906"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","article-title":"Elliptic curve cryptosystems","volume":"48","author":"Koblitz","year":"1987","journal-title":"Math. Comput."},{"key":"ref_15","unstructured":"Miller, V.S. (1986). Use of Elliptic Curves in Cryptography. Proceedings of the Advances in Cryptology\u2014CRYPTO \u201985 Proceedings, Springer. Available online: https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39799-X_31.pdf?pdf=inline%20link."},{"key":"ref_16","unstructured":"Certicom Corp (2024, October 10). Standards for Efficient Cryptography. SEC 2: Recommended Elliptic Curve Domain Parameters., Available online: http:\/\/www.secg.org\/sec2-v2.pdf."},{"key":"ref_17","unstructured":"Barker, E., Chen, L., Roginsky, A., Vassilev, A., and Davis, R. (2024, October 10). SP 800-56A Rev. 3, Recommendation for Pair-Wise Key-Establishment Schemes Using Discrete Logarithm Cryptography, Available online: https:\/\/nvlpubs.nist.gov\/nistpubs\/SpecialPublications\/NIST.SP.800-56Ar3.pdf."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/cryptography7040057","article-title":"Hardware Implementations of Elliptic Curve Cryptography Using Shift-Sub Based Modular Multiplication Algorithms","volume":"7","author":"Li","year":"2023","journal-title":"Cryptography"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Li, Y., and Chu, W. (2021). Shift-Sub Modular Multiplication Algorithm and Hardware Implementation for RSA Cryptography. Proceedings of the 17th International Conference on Information Assurance and Security, Lecture Notes in Networks and Systems , Springer.","DOI":"10.1007\/978-3-030-96305-7_50"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s13389-017-0163-8","article-title":"The Montgomery ladder on binary elliptic curves","volume":"8","author":"Oliveira","year":"2018","journal-title":"J. Cryptogr. Eng."}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/13\/10\/265\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T16:12:03Z","timestamp":1760112723000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/13\/10\/265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,12]]},"references-count":20,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2024,10]]}},"alternative-id":["computers13100265"],"URL":"https:\/\/doi.org\/10.3390\/computers13100265","relation":{},"ISSN":["2073-431X"],"issn-type":[{"value":"2073-431X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,12]]}}}