Title :
Low complexity parallel multiplier in F(qn) over Fq
Author :
Huapeng Wu ; Anwar Hasan, M. ; Blake, Ian F.
Author_Institution :
Centre for Appl. Cryptographic Res., Waterloo Univ., Ont.
fDate :
7/1/2002 12:00:00 AM
Abstract :
In this brief, parallel multiplication in F(qn) over Fq, where q can be a prime power, is considered. A closed form proof has been given for the size complexity bound of the parallel multiplier. Implementation with reduced propagation delay has been shown with an example. Basis conversion between the weakly dual basis and the polynomial basis has also been discussed
Keywords :
Galois fields; computational complexity; cryptography; digital arithmetic; matrix multiplication; multivalued logic; parallel algorithms; polynomial matrices; basis conversion; binary tree of adders; closed form proof; cryptosystems; finite field multiplications; linear feedforward register; low complexity parallel multiplier; monic irreducible polynomial; multivalued logic; polynomial basis; prime power; reduced propagation delay; reduction matrix; size complexity bound; weakly dual basis; Application software; Circuits; Cryptography; Polynomials; Propagation delay;
Journal_Title :
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
DOI :
10.1109/TCSI.2002.800836
