Browse > Article
http://dx.doi.org/10.7471/ikeee.2020.24.3.901

A Scalable Hardware Implementation of Modular Inverse  

Choi, Jun-Baek (School of Electronic Engineering, Kumoh National Institute of Technology)
Shin, Kyung-Wook (School of Electronic Engineering, Kumoh National Institute of Technology)
Publication Information
Journal of IKEEE / v.24, no.3, 2020 , pp. 901-908 More about this Journal
Abstract
This paper describes a method for scalable hardware implementation of modular inversion. The proposed scalable architecture has a one-dimensional array of processing elements (PEs) that perform arithmetic operations in 32-bit word, and its performance and hardware size can be adjusted depending on the number of PEs used. The hardware operation of the scalable processor for modular inversion was verified by implementing it on Spartan-6 FPGA device. As a result of logic synthesis with a 180-nm CMOS standard cells, the operating frequency was estimated to be in the range of 167 to 131 MHz and the gate counts were in the range of 60,000 to 91,000 gate equivalents when the number of PEs was in the range of 1 to 10. When calculating 256-bit modular inverse, the average performance was 18.7 to 118.2 Mbps, depending on the number of PEs in the range of 1 to 10. Since our scalable architecture for computing modular inversion in GF(p) has the trade-off relationship between performance and hardware complexity depending on the number of PEs used, it can be used to efficiently implement modular inversion processor optimized for performance and hardware complexity required by applications.
Keywords
Modular inverse; Montgomery inverse; ECC; Public-key cryptography; Scalable architecture;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 D. E. Knuth, "The Art of Computer Programming, Volume 2: Seminumerical Algorithms," Addison-Wesley, Reading, Mass, USA, 3rd edition, 1997.
2 R. Lorencz, "New algorithm for classical modular inverse," in Cryptographic Hardware and Embedded Systems, ser. LNCS, vol.2523. London, UK: Springer-Verlag, pp.57-70, 2002. DOI: 10.1007/3-540-36400-5_6
3 B. S. Kaliski, "The Montgomery inverse and its applications," IEEE Transactions on Computers, vol.44, no.8, pp.1064-1065, 1995. DOI: 10.1109/12.403725   DOI
4 E. Savas and C. K. Koc, "The Montgomery modular inverse-revisited," IEEE Transactions on Computers, vol.49, no.7, pp.763-766, 2000. DOI: 10.1109/12.863048   DOI
5 H. Zhang, R. Li, L. Li and Y. Dong, "Improved speed Digital Signature Algorithm based on modular inverse," Proceedings of 2013 2nd International Conference on Measurement, Information and Control, Harbin, pp.706-710, 2013. DOI: 10.1109/MIC.2013.6758059
6 A. A. A. Gutub and A. F. Tenca, "Efficient scalable VLSI architecture for montgomery inversion in GF(p)," Integration, vol.37, no.2, pp.103-120, 2004. DOI: 10.1016/j.vlsi.2003.12.001
7 A. A. A. Gutub, A. F. Tenca and C. K. Koc, "Scalable VLSI architecture for GF(p) Montgomery modular inverse computation," Proceedings IEEE Computer Society Annual Symposium on VLSI, Pittsburgh, PA, USA, pp.53-58, 2002. DOI: 10.1109/ISVLSI.2002.1016874
8 P. J. Choi and D. K. Kim, "Efficient Hardware Montgomery Modular Inverse Module for Elliptic Curve Cryptosystem in GF(p)," Journal of Korea Multimedia Society, vol.20, no.2 pp.289-297, 2017. DOI: 10.9717/kmms.2017.20.2.289   DOI
9 Certicom, Standards for Efficient Cryptography, SEC 2: Recommended Elliptic Curve Domain Parameters, Version 1.0, 2000.
10 Y. Kim, "Efficient Algorithm for Multi-Bit Montgomery Inverse Using Refined Multiplicative Inverse Modular 2^K," IEEE Access, vol.7, pp. 906-918, 2018. DOI: 10.1109/ACCESS.2018.2885989   DOI
11 L. Hars, "Modular Inverse Algorithms Without Multiplications for Cryptographic Applications," EURASIP Journal on Embedded Systems 2006, pp.1-13, 2006. DOI: 10.1155/ES/2006/32192