Browse > Article
http://dx.doi.org/10.17662/ksdim.2022.18.1.001

Low Complexity Systolic Montgomery Multiplication over Finite Fields GF(2m)  

Lee, Keonjik (대구대학교 자유전공학부)
Publication Information
Journal of Korea Society of Digital Industry and Information Management / v.18, no.1, 2022 , pp. 1-9 More about this Journal
Abstract
Galois field arithmetic is important in error correcting codes and public-key cryptography schemes. Hardware realization of these schemes requires an efficient implementation of Galois field arithmetic operations. Multiplication is the main finite field operation and designing efficient multiplier can clearly affect the performance of compute-intensive applications. Diverse algorithms and hardware architectures are presented in the literature for hardware realization of Galois field multiplication to acquire a reduction in time and area. This paper presents a low complexity semi-systolic multiplier to facilitate parallel processing by partitioning Montgomery modular multiplication (MMM) into two independent and identical units and two-level systolic computation scheme. Analytical results indicate that the proposed multiplier achieves lower area-time (AT) complexity compared to related multipliers. Moreover, the proposed method has regularity, concurrency, and modularity, and thus is well suited for VLSI implementation. It can be applied as a core circuit for multiplication and division/exponentiation.
Keywords
Modular Multiplication; Finite Field Arithmetic; Systolic Array;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Choi, S. H. and Lee, K. J., "New systolic modular multiplication architecture for efficient Montgomery multiplication," IEICE Electronics Express, Vol.12, No.2, 2015, p.20141051.   DOI
2 Choi, S. H. and Lee, K. J., "Efficient systolic modular multiplier/squarer for fast exponentiation over GF(2m)," IEICE Electronics Express, Vol.12, No.11, 2015, p.20150222.   DOI
3 Lee, K. J., "Resource and delay efficient polynomial multiplier over finite field GF(2m)," Korea Society of Digital Industry and Information Management, Vol.16, No.2, 2020, pp.1-9.
4 Huang, W. T., Chang, C. H., Chiou, C. W. and Chou, F. H., "Concurrent error detection and correction in a polynomial basis multiplier over GF(2m)," IET Information Security, Vol.4, No.3, 2010, pp.111-124.   DOI
5 Chiou, C. W., Lee, C. M., Sun, Y. S., Lee, C. Y. and Lin, J. M., "High-throughput Dickson basis multiplier with a trinomial for lightweight cryptosystems," IET Computers & Digital Techniques, Vol.12, No.5, 2018, pp.187-191.   DOI
6 Koc, C. K. and Acar, T., "Montgomery multiplication in GF(2k)," Designs Codes and Cryptography, Vol.14, No.1, 1998, pp.57-69.   DOI
7 Kobliz, N., "Elliptic curve cryptography," Mathematics of Computation, Vol.48, No.177, 1987, pp.203-209.   DOI
8 Ibrahim, A., "Efficient parallel and serial systolic structures for multiplication and squaring over GF(2m)," Canadian Journal of Electrical and Computer Engineering, Vol.42, No.2, 2019, pp.114-120.   DOI
9 Diffie, W. and Hellman, M. E., "New directions in cryptography," IEEE Transaction Information Theory, Vol.22, No.6, 1976, pp.644-654.   DOI
10 Lee, C. Y., Chiou, C. W. and Lin, J. M., "Concurrent error detection in a polynomial basis multiplier over GF(2m)," Journal of Electronic Testing, Vol.22, No.2, 2006, pp.143-150.   DOI
11 Pillutla, S. R. and Boppana, L., "Low-latency area-efficient systolic bit-parallel GF(2m) multiplier for a narrow class of trinomials," Microelectronics Journal, Vol.117, 2021, p.105275.   DOI
12 Chiou, C. W., Lee, C. Y., Deng, A. W. and Lin, J. M., "Concurrent error detection in Montgomery multiplication over GF(2m)," IEICE Transactions on Fundamentals of Electronics, Vol.E89-A, No.2, 2006, pp.566-574.   DOI
13 Montgomery, P. L., "Modular multiplication without trial division," Mathematics of Computation, Vol.44, No.170, 1985, pp.519-521.   DOI
14 Mathe, S. E. and Boppana, L., "Design and implementation of a sequential polynomial basis multiplier over GF(2m)," KSII Transactions on Internet and Information Systems, Vol.11, No.4, 2017, pp.2680-2700.