Area and time efficient AB2 multipliers based on cellular automata

Authors:
Hyun-Sung Kim;Sung-Woon Lee
Affiliations:
School of Computer Engineering, Kyungil University, Kyungsansi, Kyungbuk, Republic of Korea;Department of Information Security, Tongmyong University, Busan, 608-711, Republic of Korea
Venue:
Computer Standards & Interfaces
Year:
2009

Citing 5
Cited 1

Group Properties of Cellular Automata and VLSI Applications

IEEE Transactions on Computers
Structure of parallel multipliers for a class of fields GF(2m)

Information and Computation
New Systolic Arrays for C + AB2, Inversion, and Division in GF(2m)

IEEE Transactions on Computers
A Systolic Power-Sum Circuit for GF(2/sup m/)

IEEE Transactions on Computers
The use of finite fields to compute convolutions

IEEE Transactions on Information Theory

Novel bit-parallel multiplier for GF(2m) defined by all-one polynomial using generalized Karatsuba algorithm

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finite field operations have been widely used in the data communication security applications. This paper proposes two AB^2 multipliers based on the cellular automata over finite field. They deploy the mixture advantages in the perspective of both in area and time complexity by applying the property of irreducible all one polynomial as a modulus. First, an AB^2 multiplier is proposed with a new algorithm. Then, another algorithm and its architecture for AB^2 multiplication are derived to reduce the complex wiring in the first architecture. They can be used as a basic architecture for the public key cryptosystems in IEEE P1363.