A novel polynomial basis multiplier for arbitrary elliptic curves over GF (2m)

Finite field GF (2m) arithmetic plays a crucial role in applications like Computer algebra, Coding theory and Elliptic Curve Cryptography (ECC). The GF (2m) multiplication is considered significant building block among the finite field arithmetic operations. A new shift and add polynomial basis mult... View More