A new elliptic curve cryptosystem for securing sensitive data applications. (1st January 2013)

• Record Type: Journal Article
• Authors: Vigila, S. Maria Celestin; Muneeswaran, K.
• Is Part Of: International journal of electronic security and digital forensics. Volume 5:Number 1(2013)
• Page Start: 11
• Page End: 24
• Publication Date: 2013-01-01
• Subjects: elliptic curve cryptography -- ECC -- discrete logarithm -- nonce -- comparative linear congruential generator -- CLCG -- Knapsack algorithm; Computer crimes -- Periodicals; Computer crimes -- Investigation -- Periodicals; Computer security -- Periodicals; Electronic commerce -- Law and legislation -- Periodicals; Information warfare -- Periodicals; 005.805
• Languages: English
• ISSNs: 1751-911X

Abstract

Enhancing security is the main intention for public key cryptosystems on the basis of the hardness of the obstinate computational problems. In this paper, the ASCII value depiction of the text message is mapped into a point on elliptic curve and this initiates a few order of complexity yet before the message is encrypted. Next, the process of encryption/decryption of a mapped elliptic curve point is illustrated by enhancing security using comparative linear congruential generator and then subjecting it to the knapsack algorithm. These steps introduce scrupulous confusion and diffusion to smash any attempt at brute force attacks. This paper also discusses the security aspects of the proposed cryptosystem which is secure against all kinds of attacks.