ETRI Knowledge Sharing Platform : Fast Bit-Parallel Shifted Polynomial Basis Multiplier Using Weakly Dual Basis Over GF 2m

Titles

논문 검색
Type		SCI
Year	~	Keyword

List

Journal Article Fast Bit-Parallel Shifted Polynomial Basis Multiplier Using Weakly Dual Basis Over GF 2m

Cited 8 time in scopus

Citation: IEEE Transactions on Very Large Scale Integration (VLSI) Systems, v.19, no.12, pp.2317-2321

Abstract: In this paper, we present a new method to compute the Mastrovito matrix for 2m generated by an arbitrary irreducible polynomial using weakly dual basis of shifted polynomial basis. In particular, we derive the explicit formulas of the proposed multiplier for special type of irreducible pentanomial xm+xk3+xk2+xk1+1 with k1 < k2 ?돞 (k1+k3)/2 < k3 < min (2k1,m/2). As a result, the time complexity of the proposed multiplier matches or outperforms the previously known results. On the other hand, the number of XOR gates of the proposed multiplier is slightly greater than the best known results. © 2006 IEEE.

KSP Keywords: Shifted polynomial basis(SPB), Time Complexity, Weakly dual basis, bit-parallel, irreducible polynomial, new method

218 Gajeong-ro, Yuseong-gu, Daejeon, 34129, KOREA, Contact: sh.kim@etri.re.kr

Please refrain from automatic collection of e-mail addresses posted on this homepage.