본문 바로가기
  • Home

Efficient Semi-systolic Montgomery multiplier over GF(2^m)

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2023, 28(2), pp.69-75
  • DOI : 10.9708/jksci.2023.28.02.069
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science
  • Received : January 10, 2023
  • Accepted : January 31, 2023
  • Published : February 28, 2023

Keewon Kim 1

1목포해양대학교

Accredited

ABSTRACT

Finite field arithmetic operations play an important role in a variety of applications, including modern cryptography and error correction codes. In this paper, we propose an efficient multiplication algorithm over finite fields using the Montgomery multiplication algorithm. Existing multipliers can be implemented using AND and XOR gates, but in order to reduce time and space complexity, we propose an algorithm using NAND and NOR gates. Also, based on the proposed algorithm, an efficient semi-systolic finite field multiplier with low space and low latency is proposed. The proposed multiplier has a lower area-time complexity than the existing multipliers. Compared to existing structures, the proposed multiplier over finite fields reduces space-time complexity by about 71%, 66%, and 33% compared to the multipliers of Chiou et al., Huang et al., and Kim-Jeon. As a result, our multiplier is proper for VLSI and can be successfully implemented as an essential module for various applications.

Citation status

* References for papers published after 2022 are currently being built.