Knapsack based ECC for digital signature authentication Online publication date: Mon, 03-Aug-2009
by R. Rajaram, M. Amutha Prabakar, M. Indra Devi
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 3, No. 4, 2009
Abstract: Elliptic curve cryptography (ECC) provides a secure means of exchanging keys among communicating hosts using the Diffie Hellman key exchange algorithm. Encryption and decryption of texts and messages have also been attempted. This paper presents the ECC implementation for digital signature authentication and then applying the knapsack algorithm on ECC signing message. In this paper, we attempt to provide more secure digital signature scheme by using knapsack based ECC. We compare our proposed algorithm with RSA based digital signature authentication algorithm and show that our algorithm is better due to the high degree of sophistication and complexity involved. It is almost infeasible to attempt a brute force attack. Moreover, only one parameter namely the knapsack vector ai needs to be kept secret. On the contrary in RSA, three parameters such as the modulus n, its factors p and q need to be kept secret.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook