A fast finite field multiplier architecture for high-security elliptic curve cryptosystems
A new approach on designing a finite field multiplier architecture is proposed. The proposed architecture trades reduction in the number of clock cycles with resources. This architecture features high performance, simple structure, scalability and independence on the choice of the finite field, and can be used in high security cryptographic applications such as elliptic curve crypto-systems in large prime Galois Fields (GF(2(m))).
finite field multiplier security elliptic curve cryptography vlsi