Efficient FPGA implementation of elliptic curve scalar multiplication over the binary field

Elliptic curve cryptography (ECC) is the more efficient alternative to the widely used Ron Rivest, Adi Shamir and Leonard Adleman (RSA) cryptosystem since 283 bit ECC provides the same security per bit as 3072 bit RSA. This makes it useful for resource constrained portable devices since smaller operands can be used. For practical use of ECC, an efficient hardware implementation must be achieved in terms of area and time. Elliptic curve scalar multiplication (ECSM) is the crucial operation required for ECC processors. The goal of this research is the implementation of area efficient and high speed ECSM over a binary field in in field-programmable gate array (FGPA) technology.