Design of Montgomery multiplication architecture based on programmable cellular automata

Abstract

This study presents a Montgomery multiplication architecture using irreducible all one polynomial (AOP) in GF(2/sup m/) based on programmable cellular automata (PCA). The proposed architecture has the advantage of high regularity and a reduced latency based on combining the characteristics of irreducible AOP and PCA. The proposed architecture is possible to implement the modular exponentiation, division, inversion architectures.