The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2002 vol.51)
pp: 1306-1316
ABSTRACT
<p><b>Abstract</b>—This article presents simple and highly regular architectures for finite field multipliers using a redundant representation. The basic idea is to embed a finite field into a cyclotomic ring which has a basis with the elegant multiplicative structure of a cyclic group. One important feature of our architectures is that they provide area-time trade-offs which enable us to implement the multipliers in a partial-parallel/hybrid fashion. This hybrid architecture has great significance in its VLSI implementation in very large fields. The squaring operation using the redundant representation is simply a permutation of the coordinates. It is shown that, when there is an optimal normal basis, the proposed bit-serial and hybrid multiplier architectures have very low space complexity. Constant multiplication is also considered and is shown to have an advantage in using the redundant representation.</p>
INDEX TERMS
Finite field arithmetic, cyclotomic ring, redundant set, normal basis, multiplier, squaring.
CITATION
Huapeng Wu, M. Anwar Hasan, Ian F. Blake, Shuhong Gao, "Finite Field Multiplier Using Redundant Representation", IEEE Transactions on Computers, vol.51, no. 11, pp. 1306-1316, November 2002, doi:10.1109/TC.2002.1047755
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool