Finite Field GF($2^m$)상의 Digit Serial-Parallel Multiplier 구현

Design of High-speed Digit Serial-Parallel Multiplier in Finite Field GF($2^m$)

  • 최원호 (경북대학교 정보보호학과) ;
  • 홍성표 (경북대학교 전기전자공학과)
  • 발행 : 2003.11.21

초록

This paper presents a digit-serial/parallel multiplier for finite fields GF(2m). The hardware requirements of the implemented multiplier are less than those of the existing multiplier of the same class, while processing time and area complexity. The implemented multiplier possesses the features of regularity and modularity. Thus, it is well suited to VLSI implementation. If the implemented digit-serial multiplier chooses the digit size D appropriately, it can meet the throughput requirement of a certain application with minimum hardware. The multipliers and squarers analyzed in this paper can be used efficiently for crypto processor in Elliptic Curve Cryptosystem.

키워드