발간년도 : [2014]
| 논문정보 |
|
| 논문명(한글) |
[Vol.9, No.5] A LSB-first Word-Level Normal Basis Multiplier over GF(2m) |
|
| 논문투고자 |
Yong-Suk Cho, Jae-Yeon Choi |
|
| 논문내용 |
Finite field multipliers are the basic building blocks in many applications such as error-control coding, cryptography and digital signal processing. Hence, the design of efficient dedicated finite field multiplier architectures can lead to dramatic improvement on the overall system performance. In this paper, LSB-first word-level normal basis multiplier with low latency in Galois field is presented. To speed up multiplication processing, we divide the product polynomial into several parts and then process them in parallel. The proposed multiplier operates in normal basis of GF(2m) and is faster than bit serial ones but with lower area complexity than bit parallel ones. The most significant feature of the proposed architecture is that a trade-off between hardware complexity and delay time can be achieved. |
|
| 첨부논문 |
|
|
|
|
|
자료실 > 논문지 
