Scalar Multiplication Algorithms of Elliptic Curve Cryptography over GF (2m)

Provided by: International Journal of Innovative Technology and Exploring Engineering (IJITEE)
Topic: Security
Format: PDF
Since the inception of elliptic curve cryptography by Koblitz and Miller for implementing public-key protocols as the Diffie-Hellman key agreement, elliptic curve cryptography has become one of the most researched area for providing one stop reliable and secure solution in the field of cryptography. The ECC covers all relevant asymmetric cryptographic primitives like digital signature Elliptic Curve Digital Signature Algorithm (ECDSA), key exchange and agreement protocols. Point multiplication serves as the basic building block in all ECC primitives and is the computationally most expensive operation and the authors' analysis revolves around this concept.

Find By Topic