A Secure Elliptic Curve Digital Signature Approach without Inversion
Jaya Bhaskar Muthukuru1, B. Sathyanarayana2
1Dr Jaya Bhaskar Muthu kuru, Department of Computer Science and Engineering, KL University, Vaddeswaram, Guntur, India.
2Prof. B. Sathyanarayana, Department of Computer Science & Technology, Sri Krishnadevaraya University. Ananthapur, India.
Manuscript received on November 25, 2013. | Revised Manuscript received on December 12, 2013. | Manuscript published on December 30, 2013. | PP: 454-456 | Volume-3, Issue-2, December 2013. | Retrieval Number: B2516123213/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA). Unlike the ordinary discrete logarithm problem elliptic curve discrete logarithm problem (ECDLP) has no sub-exponential time algorithm, due to this the strength per key bit is substantially greater when compare with conventional discrete logarithm systems. Elliptic curve based digital signatures are stronger and ideal for constrained environments like smart cards due to smaller bit size, thereby reducing processing overhead. Considering the security of data it is lacking regarding random number choosing or determination. This lacking leads to recovery of the private key in original Elliptic Curve Digital Signature scheme. This problem is overcome by our proposed digital signature scheme which is presented in this paper.
Keywords: Digital Signature, ECDSA, Elliptic Curve Cryptography, Elliptic Curve Digital Signature Algorithm.