Encryption Of Data Using Elliptic Curve Over Finite Fields
Dhanesh Kumar
Abstract
Open-access reader
Dhanesh Kumar
Abstract
Open-access reader
Cryptography is the study of techniques for ensuring the secrecy and authentication of the information.Public -key encryption schemes are secure only if the authenticity of the public-key is assured.Elliptic curve arithmetic can be used to develop a variety of elliptic curve cryptographic (ECC) schemes including key exchange, encryption and digital signature.The principal attraction of elliptic curve cryptography compared to RSA is that it offers equal security for a smaller key-size, thereby reducing the processing overhead.In the present paper we propose a new encryption algorithm using Elliptic Curve over finite fields.
OpenAlex reports 51 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.
Cryptography is the study of techniques for ensuring the secrecy and authentication of the information.Public -key encryption schemes are secure only if the authenticity of the public-key is assured.Elliptic curve arithmetic can be used to develop a variety of elliptic curve cryptographic (ECC) schemes including key exchange, encryption and digital signature.The principal attraction of elliptic curve cryptography compared to RSA is that it offers equal security for a smaller key-size, thereby reducing the processing overhead.In the present paper we propose a new encryption algorithm using Elliptic Curve over finite fields.
Key concepts: Elliptic curve cryptography, Computer science, Encryption, Elliptic Curve Digital Signature Algorithm, Key size, Curve25519, Public-key cryptography, Digital signature