Title :
Design of Montgomery multiplication architecture based on programmable cellular automata
Author :
Jun-Cheol Jeon ; Park, Hye-Young ; Yoo, Kee-Young
Author_Institution :
Dept. Comput. Eng., Kyungpook Nat. Univ., Daegu, South Korea
Abstract :
This study presents a Montgomery multiplication architecture using irreducible all one polynomial (AOP) in GF(2m) 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.
Keywords :
cellular automata; computer architecture; digital arithmetic; polynomials; AOP; GF(2m); Montgomery multiplication architecture; PCA; division; inversion architectures; modular exponentiation; programmable cellular automata; Arithmetic; Computer architecture; Delay; Equations; Galois fields; Hardware; Polynomials; Principal component analysis; Public key cryptography; Switches;
Conference_Titel :
Evolutionary Computation, 2003. CEC '03. The 2003 Congress on
Print_ISBN :
0-7803-7804-0
DOI :
10.1109/CEC.2003.1299874
