상세정보
학술지
New Block Recombination for Subquadratic Space Complexity Polynomial Multiplication Based on Overlap-Free Approach
- 저자
- 박선미, 장구영, 홍도원, 서청호
- 발행일
- 201708
- 출처
- IEEE Transactions on Computers, v.66 no.8, pp.1396-1406
- ISSN
- 0018-9340
- 출판사
- IEEE
- 협약과제
- 17ZH1700, 암호화된 데이터베이스에서의 데이터 저장 및 검색을 위한 암호 원천 기술 개발, 장구영
- 초록
- In this paper, we present new parallel polynomial multiplication formulas which result in subquadratic space complexity. The schemes are based on a recently proposed block recombination of polynomial multiplication formula. The proposed two-way, three-way, and four-way split polynomial multiplication formulas achieve the smallest space complexities. Moreover, by providing area-time tradeoff method, the proposed formulas enable one to choose a parallel formula for polynomial multiplication which is suited for a design environment.
- 키워드
- Binary polynomial multiplication, block recombination, finite field, overlap-free approach, subquadratic space complexity multiplier
- KSP 제안 키워드
- Overlap-free, Polynomial multiplication, Space Complexity, Split polynomial, Three-way, design environment, finite field, four-way, two-way