Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)
- 2002.06b
- /
- Pages.277-280
- /
- 2002
Characteristic Analysis of Modular Multiplier for GF($2^m$ )
유한 필드 GF($2^m$ )상의 모듈러 곱셈기 특성 분석
Abstract
This paper analyze the characteristics of three multipliers in finite fields GF(2m) from the point of view of processing time and area complexity. First, we analyze structure of three multipliers; 1) LSB-first systolic array, 2) LFSR structure, and 3) CA structure. To make performance analysis, each multiplier was modeled in VHDL and was synthesized for FPGA implementation. The simulation results show that LFSR structure is best from the point of view of area complexity, and LSB systolic array is best from the point of view of processing time per clock.
Keywords