FINITE FIELD ARITHMETIC ARCHITECTURE BASED ON CELLULAR ARRAY
Kee-Won Kim, Jun‐Cheol Jeon · International Journal of Cyber-Security and Digital Forensics · 2012
Finite field arithmetic operations, especially for the binary field GF(2 m ), have been widely used in the areas of data communication and network security applications such as errorcorrecting codes [1,2] and cryptosystems such as ECC(Elliptic Curve Cryptosystem) [3,4]. The finite field multiplication is the most frequently studied. This is because the timeconsuming operations such as exponentiation, division, and multiplicative inversion can be decomposed into repeated multiplications. Thus, the fast multiplication architecture with low complexity is needed to design dedicated high-speed circuits.