{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T07:16:15Z","timestamp":1760426175755,"version":"build-2065373602"},"reference-count":19,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T00:00:00Z","timestamp":1699574400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>Elliptic curve cryptography (ECC) over prime fields relies on scalar point multiplication realized by point addition and point doubling. Point addition and point doubling operations consist of many modular multiplications of large operands (256 bits for example), especially in projective and Jacobian coordinates which eliminate the modular inversion required in affine coordinates for every point addition or point doubling operation. Accelerating modular multiplication is therefore important for high-performance ECC. This paper presents the hardware implementations of modular multiplication algorithms, including (1) interleaved modular multiplication (IMM), (2) Montgomery modular multiplication (MMM), (3) shift-sub modular multiplication (SSMM), (4) SSMM with advance preparation (SSMMPRE), and (5) SSMM with CSAs and sign detection (SSMMCSA) algorithms, and evaluates their execution time (the number of clock cycles and clock frequency) and required hardware resources (ALMs and registers). Experimental results show that SSMM is 1.80 times faster than IMM, and SSMMCSA is 3.27 times faster than IMM. We also present the ECC hardware implementations based on the Secp256k1 protocol in affine, projective, and Jacobian coordinates using the IMM, SSMM, SSMMPRE, and SSMMCSA algorithms, and investigate their cost and performance. Our ECC implementations can be applied to the design of hardware security module systems.<\/jats:p>","DOI":"10.3390\/cryptography7040057","type":"journal-article","created":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T02:46:47Z","timestamp":1699843607000},"page":"57","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hardware Implementations of Elliptic Curve Cryptography Using Shift-Sub Based Modular Multiplication Algorithms"],"prefix":"10.3390","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0069-5629","authenticated-orcid":false,"given":"Yamin","family":"Li","sequence":"first","affiliation":[{"name":"Computer Architecture Laboratory, Faculty of Computer and Information Sciences, Hosei University, Tokyo 184-8584, Japan"}]}],"member":"1968","published-online":{"date-parts":[[2023,11,10]]},"reference":[{"key":"ref_1","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_2","unstructured":"Miller, V.S. (1986). 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_3","unstructured":"Hankerson, D., Menezes, A., and Vanstone, S. (2004). Guide to Elliptic Curve Cryptography, Springer."},{"key":"ref_4","unstructured":"Certicom_Corp (2010). Standards for Efficient Cryptography. SEC 2: Recommended Elliptic Curve Domain Parameters, Certicom Corp. Available online: http:\/\/www.secg.org\/sec2-v2.pdf."},{"key":"ref_5","unstructured":"Barker, E., Chen, L., Roginsky, A., Vassilev, A., and Davis, R. (2023, October 15). 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_6","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1109\/TC.1983.1676262","article-title":"A Computer Algorithm for Calculating the Product AB Modulo M","volume":"C-32","author":"Blakely","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"178811","DOI":"10.1109\/ACCESS.2019.2958491","article-title":"FPGA Implementation of High-Speed Area-Efficient Processor for Elliptic Curve Point Multiplication over Prime Field","volume":"7","author":"Islam","year":"2019","journal-title":"IEEE Access"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"73898","DOI":"10.1109\/ACCESS.2020.2988379","article-title":"Area-Time Efficient Hardware Implementation of Modular Multiplication for Elliptic Curve Cryptography","volume":"8","author":"Islam","year":"2020","journal-title":"IEEE Access"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Hu, X., Zheng, X., Zhang, S., Cai, S., and Xiong, X. (2018). A Low Hardware Consumption Elliptic Curve Cryptographic Architecture over GF(p) in Embedded Application. Electronics, 7.","DOI":"10.3390\/electronics7070104"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"8883614","DOI":"10.1155\/2021\/8883614","article-title":"A Hardware-Efficient Elliptic Curve Cryptographic Architecture over GF(p)","volume":"2021","author":"Cui","year":"2021","journal-title":"Math. Probl. Eng."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1049\/iet-cdt.2016.0033","article-title":"High-performance elliptic curve cryptography processor over NIST prime fields","volume":"11","author":"Hossain","year":"2017","journal-title":"IET Comput. Digit. Tech."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2353","DOI":"10.1109\/TIE.2016.2625241","article-title":"An Efficient and Flexible Hardware Implementation of the Dual-Field Elliptic Curve Cryptographic Processor","volume":"64","author":"Liu","year":"2017","journal-title":"IEEE Trans. Ind. Electron."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Di Matteo, S., Baldanzi, L., Crocetti, L., Nannipieri, P., Fanucci, L., and Saponara, S. (2021). Secure Elliptic Curve Crypto-Processor for Real-Time IoT Applications. Energies, 14.","DOI":"10.3390\/en14154676"},{"key":"ref_14","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":"Montgomery","year":"1985","journal-title":"Math. Comput."},{"key":"ref_15","unstructured":"Li, Y., and Chu, W. (2021). Hybrid Intelligent Systems, Springer."},{"key":"ref_16","first-page":"113","article-title":"Verilog HDL Implementation for an RSA Cryptography using Shift-Sub Modular Multiplication Algorithm","volume":"17","author":"Li","year":"2022","journal-title":"J. Inf. Assur. Secur."},{"key":"ref_17","unstructured":"Bunimov, V., and Schimmler, M. (2003, January 24\u201326). Area and time efficient modular multiplication of large integers. Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors, The Hague, The Netherlands."},{"key":"ref_18","first-page":"7","article-title":"A Survey of the Elliptic Curve Integrated Encryption Scheme","volume":"2","year":"2010","journal-title":"J. Comput. Sci. Eng."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Chen, L., Moody, D., Regenscheid, A., Robinson, A., and Randall, K. (2023, October 15). Recommendations for Discrete Logarithm-based Cryptography: Elliptic Curve Domain Parameters. NIST Special Publication NIST SP 800-186, Available online: https:\/\/nvlpubs.nist.gov\/nistpubs\/SpecialPublications\/NIST.SP.800-186.pdf.","DOI":"10.6028\/NIST.SP.800-186"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/7\/4\/57\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:21:14Z","timestamp":1760131274000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/7\/4\/57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,10]]},"references-count":19,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["cryptography7040057"],"URL":"https:\/\/doi.org\/10.3390\/cryptography7040057","relation":{},"ISSN":["2410-387X"],"issn-type":[{"type":"electronic","value":"2410-387X"}],"subject":[],"published":{"date-parts":[[2023,11,10]]}}}