Implementation of text based cryptosystem using Elliptic Curve Cryptography
S. Maria Celestin Vigila, K. Muneeswaran
Abstract
S. Maria Celestin Vigila, K. Muneeswaran
Abstract
Data encryption is widely used to ensure security in open networks such as the internet. With the fast development of cryptography research and computer technology, the capabilities of cryptosystems such as of RSA and Diffie-Hellman are inadequate due the requirement of large number of bits. The cryptosystem based on elliptic curve cryptography (ECC) is becoming the recent trend of public key cryptography. This paper presents the implementation of ECC by first transforming the message into an affine point on the elliptic curve (EC), over the finite field GF(p). In ECC we normally start with an affine point called Pm(x,y) which lies on the elliptic curve. In this paper we illustrate the process of encryption/decryption of a text message . It is almost infeasible to attempt a brute force attack to break the cryptosystem using ECC.
OpenAlex reports 67 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Data encryption is widely used to ensure security in open networks such as the internet. With the fast development of cryptography research and computer technology, the capabilities of cryptosystems such as of RSA and Diffie-Hellman are inadequate due the requirement of large number of bits. The cryptosystem based on elliptic curve cryptography (ECC) is becoming the recent trend of public key cryptography. This paper presents the implementation of ECC by first transforming the message into an affine point on the elliptic curve (EC), over the finite field GF(p). In ECC we normally start with an affine point called Pm(x,y) which lies on the elliptic curve. In this paper we illustrate the process of encryption/decryption of a text message . It is almost infeasible to attempt a brute force attack to break the cryptosystem using ECC.
Key concepts: Elliptic curve cryptography, Computer science, Encryption, Cryptography, Curve25519, Public-key cryptography, Cryptosystem, Elliptic curve