Journal of Korea Society of Digital Industry and Information Management (디지털산업정보학회논문지)

Korea Society of Digital Industry and Information Management (디지털산업정보학회)
권호 표지
DOI QR코드

DOI QR Code

Resource and Delay Efficient Polynomial Multiplier over Finite Fields GF (2m)

유한체상의 자원과 시간에 효율적인 다항식 곱셈기

  • 이건직 (대구대학교 자유전공학부)
  • Received : 2020.03.02
  • Accepted : 2020.04.10
  • Published : 2020.06.30
Download PDF
⟨ Previous Next ⟩

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.

Keywords

References

  1. Diffie, W. and Hellman, M. E., "New directions in cryptography," IEEE Transaction Information Theory, Vol.22, No.6, 1976, pp.644-654. https://doi.org/10.1109/TIT.1976.1055638
  2. Kobliz, N., "Elliptic curve cryptography," Mathematics of Computation, Vol.48, No.177, 1987, pp.203-209. https://doi.org/10.1090/S0025-5718-1987-0866109-5
  3. Lee, C. Y., Chiou, C. W. and Lin, J. M., "Concurrent error detection in a polynomial basis multiplier over GF($2^m$)," Journal of Electronic Testing, Vol.22, No.2, 2006, pp.143-150. https://doi.org/10.1007/s10836-006-7446-9
  4. Chiou, C. W., Lee, C. Y., Deng, A. W. and Lin, J. M., "Concurrent error detection in Montgomery multiplication over GF($2^m$)," IEICE Transactions on Fundamentals of Electronics, Vol.E89-A, No.2, 2006, pp.566-574. https://doi.org/10.1093/ietfec/e89-a.2.566
  5. 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($2^m$)," IET Information Security, Vol.4, No.3, 2010, pp.111-124. https://doi.org/10.1049/iet-ifs.2009.0160
  6. Kim, K. W. and Kim, S. H., "A low latency semi-systolic multiplier over GF($2^m$)," IEICE Electronics Express, Vol.10, No.13, 2013, p.20130354. https://doi.org/10.1587/elex.10.20130354
  7. Choi, S. H. and Lee, K. J., "Efficient systolic modular multiplier/squarer for fast exponentiation over GF($2^m$)," IEICE Electronics Express, Vol.12, No.11, 2015, p.20150222. https://doi.org/10.1587/elex.12.20150222
  8. 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. https://doi.org/10.1049/iet-cdt.2017.0209
  9. Lee, H. H. and Kim, K. W., "Efficient semi-systolic finite field multiplier using redundant basis," International Scholarly and Scientific Research & Innovation, Vol.10, No.10, 2016, pp.1563-1567.
  10. Mathe, S. E. and Boppana, L., "Design and implementation of a sequential polynomial basis multiplier over GF($2^m$)," KSII Transactions on Internet and Information Systems, Vol.11, No.4, 2017, pp.2680-2700.
  11. Ibrahim, A., "Efficient parallel and serial systolic structures for multiplication and squaring over GF($2^m$)," Canadian Journal of Electrical and Computer Engineering, Vol.42, No.2, 2019, pp.114-120. https://doi.org/10.1109/CJECE.2019.2900087
  12. Montgomery, P. L., "Modular multiplication without trial division," Mathematics of Computation, Vol.44, No.170, 1985, pp.519-521. https://doi.org/10.1090/S0025-5718-1985-0777282-X
  13. Koc, C. K. and Acar, T., "Montgomery multiplication in GF($2^k$)," Designs Codes and Cryptography, Vol.14, No.1, 1998, pp.57-69. https://doi.org/10.1023/A:1008208521515
  14. Lee, W. H., Lee, K. J. and Yoo, K. Y., "New digit-serial systolic arrays for power-sum and division operation in GF($2^m$)," Lecture Notes in Computer Science, Vol.3045, 2004, pp.638-647.