Compact Bit-Parallel Systolic Montgomery Multiplication Over GF(2m) Generated by Trinomials

Author

Lee, Chiou-Yng ; Chen, Chin-Chin ; Lu, Erl-Huei

Author_Institution

Lunghwa Univ. of Sci. & Technol.

fYear

2006

fDate

14-17 Nov. 2006

Firstpage

1

Lastpage

4

Abstract

This paper presents a scalable and systolic Montgomery´s algorithm in GF(2^m) using the Hankel matrix-vector representation. The hardware architectures derived from this algorithm represents low-complexity bit-parallel systolic multipliers with trinomials. The results reveal that our proposed multiplier saves approximately 36% space complexity as compared to an existing systolic Montgomery multiplier for trinomials. Moreover, the proposed architectures have the features of regularity, modularity, and local interconnect ability. Accordingly, they are well suited for VLSI implementation

Keywords

Galois fields; Hankel matrices; VLSI; systolic arrays; GF(2^m); Hankel matrix-vector representation; VLSI implementation; bit-parallel systolic Montgomery multiplier; trinomials; very large scale integration; Arithmetic; Computer architecture; Elliptic curve cryptography; Galois fields; Hardware; Matrix decomposition; Paper technology; Polynomials; Public key cryptography; Very large scale integration; Bit-Parallel Systolic Multiplier; Hankel Matrix-Vector; Trinomial;

fLanguage

English

Publisher

ieee

Conference_Titel

TENCON 2006. 2006 IEEE Region 10 Conference

Conference_Location

Hong Kong

Print_ISBN

1-4244-0548-3

Electronic_ISBN

1-4244-0549-1

Type

conf

DOI

10.1109/TENCON.2006.343995

Filename

4142187