Abstract
It is well-known that a class of finite fields GF(2n) using an optimal normal basis is most suitable for a hardware implementation of arithmetic in finite fields. In this paper, we introduce composite fields of some hardware-applicable properties resulting from the normal basis representation and the optimal condition. We also present a hardware architecture of the proposed composite fields including a bit-parallel multiplier.
Original language | English |
---|---|
Pages (from-to) | 1133-1138 |
Number of pages | 6 |
Journal | IEEE Transactions on Computers |
Volume | 49 |
Issue number | 10 |
DOIs | |
Publication status | Published - 2000 Oct |
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics