Standard Basis를 기반으로 하는 유한체내 고속 GF($2^m$) 곱셈기 설계

A High speed Standard Basis GF(2$^{m}$ ) Multiplier with A Known Primitive Coefficient Set

  • 최성수 (광주과학기술원 정보통신공학과 디지털 통신 시스템 연구실) ;
  • 이영규 (광주과학기술원 정보통신공학과 디지털 통신 시스템 연구실) ;
  • 박민경 (광주과학기술원 정보통신공학과 디지털 통신 시스템 연구실) ;
  • 김기선 (광주과학기술원 정보통신공학과 디지털 통신 시스템 연구실)
  • 발행 : 1999.06.01

초록

In this paper, a new high speed parallel input and parallel output GF(2$^{m}$ ) multiplier based on standard basis is proposed. The concept of the multiplication in standard basis coordinates gives an easier VLSI implementation than that of the dual basis. This proposed algorithm and method of implementation of the GF(2$^{m}$ ) multiplication are represented by two kinds of basic cells (which are the generalized and fixed basic cell), and the minimum critical path with pipelined operation. In the case of the generalized basic cell, the proposed multiplier is composed of $m^2$ basic cells where each cell has 2 two input AND gates, 2 two input XOR gates, and 2 one bit latches Specifically, we show that the proposed multiplier has smaller complexity than those proposed in 〔5〕.

키워드