New AB~2 Multiplier over GF(2~m) using Cellular Automata

摘要

AB~2 multiplication over GF(2~m) is an essential operation in modular exponentiation, which is the basic computation for most public key crypto systems. The current paper presents a new architecture that can perform AB~2 multiplication over GF(2~m) in m clock cycles using a cellular automata. Since cellular automata architecture is simple, regular, modular, and cascadable, it can be utilized efficiently for the implementation of VLSI.