Design of new AB2 multiplier over GF(2m) using cellular automata

AB² multiplication over GF(2^m) is an essential operation in modular exponentiation, which is the basic computation for most public key cryptosystems. The authors present a new architecture that can perform AB² multiplication over GF(2^m) in m clock cycles using cellular automata. The proposed cellular automata architecture is also well suited to VLSI implementation because it is simple, regular, modular, and cascadable.