A study on the multiplier for finite field GF($2^m$)

GF($2^m$)상의 승산기 구성에 관한 연구

  • Won, D.H. (Dept. of Information Eng. Sung Kyun Kwan University) ;
  • Kim, B.C. (Dept. of Electronic Eng. Sung Kyun Kwan University)
  • 원동호 (성균관대학교 정보공학과) ;
  • 김병찬 (성균관대학교 전자공학과)
  • Published : 1987.07.03

Abstract

Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and basis conversion algorithms. In this paper, a new multiplication circuit is developed for the finite field GF($2^m$) based on a conventional basis. It is composed of AND gates and EXCLUSIVE-OR gates and is regular, simple, expandable and therefore, naturally suitable for VLSI implementations.

Keywords