Title: A new elliptic curve cryptosystem for securing sensitive data applications

Authors: S. Maria Celestin Vigila; K. Muneeswaran

Addresses: Department of Information Technology, Noorul Islam College of Engineering, Kumaracoil – 629 180, Tamilnadu, India ' Department of Computer Science and Engineering, Mepco Schlenk Engineering College, Sivakasi – 626 005, Tamilnadu, India

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.

Keywords: elliptic curve cryptography; ECC; discrete logarithm; nonce; comparative linear congruential generator; CLCG; Knapsack algorithm; data security; sensitive data; public key cryptosystems; text messages; attacks.

DOI: 10.1504/IJESDF.2013.054405

International Journal of Electronic Security and Digital Forensics, 2013 Vol.5 No.1, pp.11 - 24

Received: 24 Mar 2012
Accepted: 09 Oct 2012

Published online: 26 Jul 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article