Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Encryption of Data using Elliptic Curve over Finite fields (1202.1895v1)

Published 9 Feb 2012 in cs.CR

Abstract: 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 cryptography (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 some Elliptic Curve over finite fields

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. D. Sravana Kumar (2 papers)
  2. CH. Suneetha (2 papers)
  3. A. Chandrasekhar (2 papers)
Citations (61)

Summary

We haven't generated a summary for this paper yet.