상세정보
학술지
Fast Bit-Parallel Shifted Polynomial Basis Multiplier Using Weakly Dual Basis Over GF 2m
- 저자
- 박선미, 장구영
- 발행일
- 201112
- 출처
- IEEE Transactions on Very Large Scale Integration (VLSI) Systems, v.19 no.12, pp.2317-2321
- ISSN
- 1063-8210
- 출판사
- IEEE
- 협약과제
- 11ZS1100, 지식서비스기반 SW 핵심기술연구, 황승구
- 초록
- 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 제안 키워드
- Bit-parallel, Shifted polynomial basis(SPB), Time Complexity, Weakly dual basis, irreducible polynomial, new method