An improvement of a elliptic curve digital signature algorithm
by Manoj Kumar Chande; Cheng-Chi Lee
International Journal of Internet Technology and Secured Transactions (IJITST), Vol. 6, No. 3, 2016

Abstract: The elliptic curve digital signature algorithm (ECDSA) is the first successful algorithm based on elliptic curve and it is elliptic curve analogue of digital signature algorithm (DSA). The security of this algorithm relies on intractability of elliptic curve discrete logarithm problem (ECDLP). This algorithm has been also used for low computational capacity devices like ATM cards and smart card, because of their short key and low computational cost. In this paper, we analyse the Junru's ECDSA and improve his scheme by using two random numbers for signature generation. This will reduce the probability of risk of exposure of secret key. Therefore, the improved scheme can enhance the security of the Junru's ECDSA.

Online publication date: Wed, 16-Nov-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Technology and Secured Transactions (IJITST):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com