Authors: Manoj Kumar Chande; Cheng-Chi Lee
Addresses: School of Studies in Mathematics, Pt. Ravishankar Shukla University, Raipur, 492010, Chhattisgarh, India ' Department of Library and Information Science, Fu Jen Catholic University, No. 510, Jhongjheng Road, New Taipei City 24205, Taiwan; Department of Photonics and Communication Engineering, Asia University, No. 500, Lioufeng Road, Taichung City 41354, Taiwan
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.
Keywords: cryptosystems; digital signatures; elliptic curve discrete logarithm problem; ECDLP; elliptic curve digital signature algorithm; ECDSA; random numbers; cryptography; elliptic curves; security; ATM cards; smart cards; signature generation.
International Journal of Internet Technology and Secured Transactions, 2016 Vol.6 No.3, pp.219 - 230
Available online: 16 Nov 2016 *Full-text access for editors Access for subscribers Purchase this article Comment on this article