A new enhancement of elliptic curve digital signature algorithm. (2nd April 2020)

• Record Type: Journal Article
• Authors: Mehibel, Nissa; Hamadouche, M'hamed
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 23:Number 3(2020)
• Page Start: 743
• Page End: 757
• Publication Date: 2020-04-02
• Subjects: 14H52 -- 94A60; Elliptic Curves -- Elliptic Curve Cryptography -- Elliptic Curve Discrete Logarithm Problem -- Elliptic Curve Digital Signature Algorithm; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2019.1615673
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: Elliptic Curve Digital Signature Algorithm (ECDSA) is a public key cryptographic algorithm based on the hardness of the Elliptic Curve Discrete Logarithm Problem (ECDLP), it is used to ensure users' authentication, data integrity and transactions non-repudiation. However, its weakness is to derive the signer's private key in case he uses the same random number for to generate two signatures for two different messages. Firstly, in this paper we present the ECDSA and analyse its variants proposed in the literature.Also, we propose a new improvement technique for ECDSA of Liao and Shen and ECDSA of Chande and Lee. We intend to do so by introducing the unknown parameters which are used in the verification of the signature. Our aim is to overcome the problem which has not been explained in ECDSA schemes of both Liao and Shen and Chande and Lee.