| Autor: |
Kumar, D. Sravana, Suneetha, CH., Chandrasekhar, A. |
| Rok vydání: |
2012 |
| Předmět: |
|
| Zdroj: |
International Journal of Distributed and Parallel Sysstems(IJDPS) Vol.3 No.1 January 2012 |
| Druh dokumentu: |
Working Paper |
| DOI: |
10.5121/ijdps.2012.3125 |
| Popis: |
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 |
| Databáze: |
arXiv |
| Externí odkaz: |
|
