Journal of IKEEE (전기전자학회논문지)

Institute of Korean Electrical and Electronics Engineers (한국전기전자학회)
권호 표지
DOI QR코드

DOI QR Code

A Scalable Montgomery Modular Multiplier

확장 가능형 몽고메리 모듈러 곱셈기

  • Received : 2021.11.25
  • Accepted : 2021.12.15
  • Published : 2021.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper describes a scalable architecture for flexible hardware implementation of Montgomery modular multiplication. Our scalable modular multiplier architecture, which is based on a one-dimensional array of processing elements (PEs), performs word parallel operation and allows us to adjust computational performance and hardware complexity depending on the number of PEs used, NPE. Based on the proposed architecture, we designed a scalable Montgomery modular multiplier (sMM) core supporting eight field sizes defined in SEC2. Synthesized with 180-nm CMOS cell library, our sMM core was implemented with 38,317 gate equivalents (GEs) and 139,390 GEs for NPE=1 and NPE=8, respectively. When operating with a 100 MHz clock, it was evaluated that 256-bit modular multiplications of 0.57 million times/sec for NPE=1 and 3.5 million times/sec for NPE=8 can be computed. Our sMM core has the advantage of enabling an optimized implementation by determining the number of PEs to be used in consideration of computational performance and hardware resources required in application fields, and it can be used as an IP (intellectual property) in scalable hardware design of elliptic curve cryptography (ECC).

몽고메리 모듈러 곱셈의 유연한 하드웨어 구현을 위한 확장 가능형 아키텍처를 기술한다. 처리요소 (processing element; PE)의 1차원 배열을 기반으로 하는 확장 가능형 모듈러 곱셈기 구조는 워드 병렬 연산을 수행하며, 사용되는 PE 개수 NPE에 따라 연산 성능과 하드웨어 복잡도를 조정하여 구현할 수 있다. 제안된 아키텍처를 기반으로 SEC2에 정의된 8가지 필드 크기를 지원하는 확장 가능형 몽고메리 모듈러 곱셈기(scalable Montgomery modular multiplier; sMM) 코어를 설계했다. 180-nm CMOS 셀 라이브러리로 합성한 결과, sMM 코어는 NPE=1 및 NPE=8인 경우에 각각 38,317 등가게이트 (GEs) 및 139,390 GEs로 구현되었으며, 100 MHz 클록으로 동작할 때, NPE=1인 경우에 57만회/초 및 NPE=8인 경우에 350만회/초의 256-비트 모듈러 곱셈을 연산할 수 있는 것으로 평가되었다. sMM 코어는 응용분야에서 요구되는 연산성능과 하드웨어 리소스를 고려하여 사용할 PE 수를 결정함으로써 최적화된 구현이 가능하다는 장점을 가지며, ECC의 확장 가능한 하드웨어 설계에 IP (intellectual property)로 사용될 수 있다.

Keywords

Acknowledgement

This work was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (No. NRF-2020R1I1A3A04038083) Authors are thankful to IDEC for supporting EDA software.

References

  1. N. Koblitz, "Elliptic curve cryptosystems," Mathematics of Computation, vol.48, no.177, pp.203-209, 1987. https://doi.org/10.1090/S0025-5718-1987-0866109-5
  2. S. Sugiyama, H. Awano and M. Ikeda, "Low Latency 256-bit Fp ECDSA Signature Generation Crypto Processor," IEICE Transaction on Fundamentals, vol.E101-A, no.12, pp.2290-2296, 2018. DOI: 10.1587/transfun.E101.A.2290
  3. M. Knezevic, V. Nikov, and P. Rombouts, "Low-latency ECDSA signature verification-A road toward safer traffic," IEEE Transaction on Very Large Scale Integration (VLSI) Systems, vol.24, no.11, pp.3257-3267, 2016. DOI: 10.1109/TVLSI.2016.2557965
  4. ITS Committee, "IEEE standard for wireless access in vehicular environments-security services for applications and management messages," IEEE Vehicular Technology Society, Vol.1609, No.2, 2013. DOI: 10.1109/IEEESTD.2016.7426684
  5. D. S. Kim and K. Y. Shin, "Montgomery Multiplier supporting Dual-Field Modular Multiplication," Journal of the Korea Institute of Information and Communication Engineering, vol.24, no.6, pp.736-743, 2020. DOI: 10.6109/jkiice.2020.24.6.736
  6. M. Amine, E. M. Nadia, L. Ronan, J. B. Rigaud, B. Belgacem, M. Sihem and M. Mohsen, "A Scalable and Systolic Architectures of Montgomery Modular Multiplication for Public Key Cryptosystems Based on DSPs," Journal of Hardware and Systems Security, vol.1, issue3, pp.219-236, 2017. DOI: 10.1007/s41635-017-0018-x.
  7. M. Shieh and W. Lin, "Word-Based Montgomery Modular Multiplication Algorithm for Low-Latency Scalable Architectures," in IEEE Transactions on Computers, vol.59, no.8, pp.1145-1151, 2010. DOI: 10.1109/TC.2010.72
  8. S. Kuang, C. Liang and C. Chen, "An Efficient Radix-4 Scalable Architecture for Montgomery Modular Multiplication," in IEEE Transactions on Circuits and Systems II: Express Briefs, vol.63, no.6, pp.568-572, 2016. DOI: 10.1109/TCSII.2016.2530801
  9. Certicom, Standards for Efficient Cryptography, SEC 2: Recommended Elliptic Curve Domain Parameters, Version 1.0, 2000.
  10. P. L. Montgomery, "Modular multiplication without trial division," Math. of Computation, vol.44, no.170, pp.519-521, 1985. https://doi.org/10.1090/S0025-5718-1985-0777282-X
  11. A. F. Tenca and C. K. Koc, "A Scalable Architecture for Montgomery Multiplication," International Workshop on Cryptographic Hardware and Embedded Systems, Springer, Heidelberg, vol.1717, pp.94-108, 1999. https://doi.org/10.1007/3-540-48059-5_10
  12. J. B. Choi, "A Scalable ECC Processor Supporting Prime Field Elliptic Curves," Master Thesis, Kumoh National Institute of Technology, 2021.
  13. K. Safiullah, J. Khalid and S. Y. Ali, "High-speed FPGA implementation of full-word Montgomery multiplier for ECC applications," Microprocessor and Microsystems, vol.62, pp.91-101, 2018. DOI: 10.1016/j.micpro.2018.07.005.
  14. K. Javeed, X. Wang and M. Scott, "Serial and parallel interleaved modular multipliers on FPGA platform," 2015 25th International Conference on Field Programmable Logic and Applications (FPL), London, pp.1-4, 2015. DOI: 10.1109/FPL.2015.7293986.
  15. M. Selim Hossain and Y. Kong, "FPGA-based efficient modular multiplication for Elliptic Curve Cryptography," 2015 International Telecommunication Networks and Applications Conference (ITNAC), Sydney, NSW, pp.191-195, 2015, DOI: 10.1109/ATNAC.2015.7366811.
  16. B. Zhang, Z. Cheng and M. Pedram, "High-Radix Design of a Scalable Montgomery Modular Multiplier with Low Latency," IEEE Transactions on Computers, Accepted for publication, 2021. DOI: 10.1109/TC.2021.3052999.