본문 바로가기

Efficient Montgomery AB2 multiplier for Finite fields defined by irreducible all-one polynomials

문서 유형
연구출판물 · 학술대회 발표논문
등재
Scopus
저널 순위
Scopus Q3
피인용
Scopus 0

저자

  1. Lee, Hyun-Ho제1저자Department of Computer Science, Dankook University, South Korea
  2. 김태완Department of Design, Pusan National University, South Korea
  3. Kim, Kee-Won교신저자Department of Applied Computer Engineering, Dankook University, South Korea

초록

Finite field arithmetic has been extensively used in error correcting codes and cryptography. Among the arithmetic operations of finite fields, multiplication is important building block of various applications. This is because the time-consuming operations such as exponentiation, division, and multiplicative inversion can be decomposed into repeated AB or AB2 multiplications. Therefore, we require an efficient algorithm and architecture for multiplication over finite fields. In this paper, we propose an efficient Montgomery AB2 multiplier over finite fields defined by irreducible all-one polynomials. The proposed AB2 multiplier has less space and time complexities compared to related multipliers. As compared to the corresponding existing structures, the proposed AB2 multiplier saves at least 59% area, 50%time, and 79% area-time (AT) complexity. Accordingly, it is well suited for VLSI implementation and can be easily applied as a basic component for computing complex operations over finite field.

키워드

All-one polynomialsCryptographyFinite fieldsMontgomery multiplicationSystolic array

식별자

Scopus EID
2-s2.0-85019432068