An efficient modified Elliptic Curve Digital Signature Algorithm

Abstract

Many digital signatures which are based on Elliptic Curves Cryptography (ECC) have been proposed. Among these digital signatures, the Elliptic Curve Digital Signature Algorithm (ECDSA) is the widely standardized one. However, the verification process of ECDSA is slower than the signature generation process. Hence, the main objective of this work is to study ECDSA in order to improve its execution time. The method of the improvement is focused on the mathematical relationships of the algorithm in a manner that its verification process can be efficient. As a result, without affecting the underlying mathematical problem – the Elliptic Curve Discrete Logarithmic Problem (ECDLP) - a related efficient scheme is developed. The signature verification algorithm of the modified scheme is found to be faster than the verification process of ECDSA by 45%.

Keywords: Digital signature, ECDSA algorithm, Elliptic curve cryptography, Scalar multiplication, Signature generation, Signature verification.