Previous [1] [2] [3] [4] [5] [6] [7] [8] [9] [10]

Journal of Information Science and Engineering, Vol.18 No.4, pp.479-488 (July 2002)

Efficient Cellular Automata Based Verstile
Multiplier for GF(2m)

Hua Li and Chang N. Zhang
Department of Computer Science, TRLabs
University of Regina
Canada S4S 0A2

In this paper, a low-complexity Programmable Cellular Automata (PCA) based versatile modular multiplier in GF(2m) is presented. The proposed versatile multiplier increases flexibility in using the same multiplier in different security environments, and it reduces the user's cost. Moreover, the multiplier can be easily extended to high order of m for more security, and low-cost serial implementation is feasible in restricted computing environments, such as smart cards and wireless devices.

Keywords: finite field multiplication, canonical basis, programmable cellular automata, VLSI, encryption

Full Text () Retrieve PDF document (200207_01.pdf)

Received August 27, 2001; accepted April 15, 2002.
Communicated by Jang-Ping Sheu, Myongsoon Park and Makoto Takizawa.