본문 바로가기
  • Home

A LSB-first Word-Level Normal Basis Multiplier over GF(2m)

  • Journal of Knowledge Information Technology and Systems
  • Abbr : JKITS
  • 2014, 9(5), pp.571-578
  • Publisher : Korea Knowledge Information Technology Society
  • Research Area : Interdisciplinary Studies > Interdisciplinary Research
  • Published : October 31, 2014

Cho Yong Suk 1 Choi, Jae Yeon 2

1영동대학교
2남서울대학교

Accredited

ABSTRACT

Finite field multipliers are the basic building blocks in many applications such as error-control coding, cryptography and digital signal processing. Hence, the design of efficient dedicated finite field multiplier architectures can lead to dramatic improvement on the overall system performance. In this paper, LSB-first word-level normal basis multiplier with low latency in Galois field is presented. To speed up multiplication processing, we divide the product polynomial into several parts and then process them in parallel. The proposed multiplier operates in normal basis of GF(2m) and is faster than bit serial ones but with lower area complexity than bit parallel ones. The most significant feature of the proposed architecture is that a trade-off between hardware complexity and delay time can be achieved.

Citation status

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