In this paper, a hardware algorithm is first proposed for executing fast division over GF(2m), and then new hardware architecture is presented based on the algorithm. The algorithm is based on the existing Extended binary GCD algorithm using standard basis representation. However, the proposed method adopts a technique which uses only two 1-bit flags for comparing the magnitude of S and R while the existing methods use m-bit comparator. From implementation results, the proposed algorithm is shown to achieve the best performance in both area and speed aspects over the existing algorithms. The designed 163- bit iterative divider operates at a clock frequency of about 359 MHz on Xilinx FPGA with Virtex4-xc4vlx15 target device.
목차
Abstract 1. Introduction 2. Fast division algorithm and its architecture for GF(2m) 2.1 Fast division algorithm 2.2 Iterative architecture of GF(2m) divider 3. Implementation Results 4. Conclusion Reference
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업