Resource and Delay Efficient Polynomial Multiplier over Finite Fields GF (2m)
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
Many cryptographic and error control coding algorithms rely on finite field GF(2m) arithmetic. Hardware implementation of these algorithms needs an efficient realization of finite field arithmetic operations. Finite field multiplication is complicated among the basic operations, and it is employed in field exponentiation and division operations. Various algorithms and architectures are proposed in the literature for hardware implementation of finite field multiplication to achieve a reduction in area and delay. In this paper, a low area and delay efficient semi-systolic multiplier over finite fields GF(2m) using the modified Montgomery modular multiplication (MMM) is presented. The least significant bit (LSB)-first multiplication and two-level parallel computing scheme are considered to improve the cell delay, latency, and area-time (AT) complexity. The proposed method has the features of regularity, modularity, and unidirectional data flow and offers a considerable improvement in AT complexity compared with related multipliers. The proposed multiplier can be used as a kernel circuit for exponentiation/division and multiplication.
Abstract
Many cryptographic and error control coding algorithms rely on finite field GF(2m) arithmetic. Hardware implementation of these algorithms needs an efficient realization of finite field arithmetic operations. Finite field multiplication is complicated among the basic operations, and it is employed in field exponentiation and division operations. Various algorithms and architectures are proposed in the literature for hardware implementation of finite field multiplication to achieve a reduction in area and delay. In this paper, a low area and delay efficient semi-systolic multiplier over finite fields GF(2m) using the modified Montgomery modular multiplication (MMM) is presented. The least significant bit (LSB)-first multiplication and two-level parallel computing scheme are considered to improve the cell delay, latency, and area-time (AT) complexity. The proposed method has the features of regularity, modularity, and unidirectional data flow and offers a considerable improvement in AT complexity compared with related multipliers. The proposed multiplier can be used as a kernel circuit for exponentiation/division and multiplication.
참고문헌 (14)
- Diffie, W., "New directions in cryptography", IEEE Transaction Information Theory, 22(6), pp.644~654 (1976)
- Kobliz, N., "Elliptic curve cryptography", Mathematics of Computation, 48(177), pp.203~209 (1987)
- Lee, C. Y., "Concurrent error detection in a polynomial basis multiplier over GF(2m)", Journal of Electronic Testing, 22(2), pp.143~150 (2006)
- Chiou, C. W., "Concurrent error detection in Montgomery multiplication over GF(2m)", IEICE Transactions on Fundamentals of Electronics, E89-A(2), pp.566~574 (2006)
- Huang, W. T., "Concurrent error detection and correction in a polynomial basis multiplier over GF(2m)", IET Information Security, 4(3), pp.111~124 (2010)
- Kim, K. W., "A low latency semi-systolic multiplier over GF(2m)", IEICE Electronics Express, 10(13), pp.20130354~ (2013)
- Choi, S. H., "Efficient systolic modular multiplier", squarer for fast exponentiation over GF(2m), 2015, pp.12(11), 20150222~
- Chiou, C. W., "High-throughput Dickson basis multiplier with a trinomial for lightweight cryptosystems", IET Computers & Digital Techniques, 12(5), pp.187~191 (2018)
- Lee, H. H., "Efficient semi-systolic finite field multiplier using redundant basis", International Scholarly and Scientific Research & Innovation, 10(10), pp.1563~1567 (2016)
- Sudha Ellison Mathe, "Design and Implementation of a Sequential Polynomial Basis Multiplier over GF(2m)", KSII Transactions on Internet and Information Systems, 11(5), pp.2680~2700 (2017), 한국인터넷정보학회[DOI]
- Ibrahim, A., "Efficient parallel and serial systolic structures for multiplication and squaring over GF(2m)", Canadian Journal of Electrical and Computer Engineering, 42(2), pp.114~120 (2019)
- Montgomery, P. L., "Modular multiplication without trial division", Mathematics of Computation, 44(170), pp.519~521 (1985)
- Koc, C. K., "Montgomery multiplication in GF(2k)", Designs Codes and Cryptography, 14(1), pp.57~69 (1998)
- Lee, W. H., "New digit-serial systolic arrays for power-sum and division operation in GF(2m)", Lecture Notes in Computer Science, 3045, pp.638~647 (2004)