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 a i 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Communication Networks and Distributed Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
