A new structure of bit-parallel Polynomial Basis(PB)multiplier is proposed,which isbased on a fast modular reduction method.The method was recommended by the National Instituteof Standards and Technology(NIST).It takes advantage of the characteristics of irreducible polyno-mial,i.e.,the degree of the second item of irreducible polynomial is far less than the degree of thepolynomial in the finite fields GF(2m).Deductions are made for a class of finite field in which trino-mials are chosen as irreducible polynomials.Let the trinomial bex m +x k+1,where 1 ≤k≤?m/2?.??The proposed structure has shorter critical path than the best known one up to date,whilethe space requirement keeps the same.The structure is practical,especially in real time crypto-graphic applications.
展开▼
