상세정보
학술지
Fast Bit-Parallel Polynomial Basis Multiplier for GF(2m) Defined by Pentanomials Using Weakly Dual Basis
- 저자
- 박선미, 장구영, 홍도원, 서창호
- 발행일
- 201301
- 출처
- IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, v.E96.A no.1, pp.322-331
- ISSN
- 1745-1337
- 출판사
- 일본, 전자정보통신학회 (IEICE)
- 협약과제
- 12SG1100, 미래 복합 컴퓨팅 환경에서의 데이터 프라이버시 강화 기술 개발, 장구영
- 초록
- In this paper, we derive a fast polynomial basis multiplier for GF(2'") defined by pentanomials jcusing the presented method by Park and Chang. The proposed multiplier has the time delay Ta + (2 + riog2(m - l)l)7x or Ta + (3 + riog2(m - l)l)7x which is the lowest one compared with known multipliers for pentanomials except for special types, where Ta and T\ denote the delays of one AND gate and one XOR gate, respectively. On the other hand, its space complexity is very slightly greater than the best known results. Copyright © 2013 The Institute of Electronics, Information and Communication Engineers.
- KSP 제안 키워드
- AND gate, Bit-parallel, Information and communication, Polynomial basis, Space Complexity, Time Delay, Weakly dual basis, XOR gate