| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428757 | Information Processing Letters | 2008 | 5 Pages |
Abstract
Based on the shifted polynomial basis (SPB), a high efficient bit-parallel multiplier for the field GF(m2) defined by an equally-spaced trinomial (EST) is proposed. The use of SPB significantly reduces time delay of the proposed multiplier and at the same time Karatsuba method is combined with SPB to decrease space complexity. As a result, with the same time complexity, approximately 3/4 gates of previous multipliers are used in the proposed multiplier.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
