CFP last date
20 May 2024
Reseach Article

Secure Key Transport in Symmetric Cryptographic Protocols using some Elliptic Curves over finite fields

by Ch. Suneetha, D. Sravana Kumar, A. Chandrasekhar, K. Vanitha
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 36 - Number 1
Year of Publication: 2011
Authors: Ch. Suneetha, D. Sravana Kumar, A. Chandrasekhar, K. Vanitha
10.5120/4456-6241

Ch. Suneetha, D. Sravana Kumar, A. Chandrasekhar, K. Vanitha . Secure Key Transport in Symmetric Cryptographic Protocols using some Elliptic Curves over finite fields. International Journal of Computer Applications. 36, 1 ( December 2011), 27-30. DOI=10.5120/4456-6241

@article{ 10.5120/4456-6241,
author = { Ch. Suneetha, D. Sravana Kumar, A. Chandrasekhar, K. Vanitha },
title = { Secure Key Transport in Symmetric Cryptographic Protocols using some Elliptic Curves over finite fields },
journal = { International Journal of Computer Applications },
issue_date = { December 2011 },
volume = { 36 },
number = { 1 },
month = { December },
year = { 2011 },
issn = { 0975-8887 },
pages = { 27-30 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume36/number1/4456-6241/ },
doi = { 10.5120/4456-6241 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:22:00.814602+05:30
%A Ch. Suneetha
%A D. Sravana Kumar
%A A. Chandrasekhar
%A K. Vanitha
%T Secure Key Transport in Symmetric Cryptographic Protocols using some Elliptic Curves over finite fields
%J International Journal of Computer Applications
%@ 0975-8887
%V 36
%N 1
%P 27-30
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
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 a new technique of secure key exchange using elliptic curve cryptography is proposed.

References
  1. Alfred J. Menezes and Scott A. Vanstone, “Elliptic Curve Cryptosystems and their implementations”, Journal of Cryptology, 1993, Volume-6, Number-4, pages 209-224.
  2. Antoines Joux, “A one round protocol for Tripartite Diffie-Hellman”, Journal of Cryptology, 2004, Volume 17, Number 4, pages 263-276.
  3. Asrjen K. Lenstra and Eric R. Verheul, “Selecting Cryptographic key size”, Journal of Cryptology, 2001, Volume-14, Number 4, pages 255-293.
  4. A. Chandrasekhar et.al. “Some Algebraic Curves in public Key crypto systems”, International Journal of Ultra Scientist of Physical Sciences, 2007.
  5. Darrel Hankerson, Alfered Menezes, Scott Vanstone, “A Gide to elliptic curve Cryptography”, Springer, 2004.
  6. Enge A. “Elliptic curves and their applications to cryptography”, Norwell, MA: Kulwer Academic publishers 1999.
  7. V.Miller, “Uses of Elliptic curves in Cryptography”.In advances in Cryptography (CRYPTO 1985), Springer LNCS 218,417-4 26, 1985
  8. Neil Koblitz, “ An Elliptic Curve implementation of the finite field digital signature algorithm”, in Advances in cryptology, (CRYPTO 1998), Springer Lecture Notes in computer science, 1462, 327-337,1998.
  9. Rosing M. “Implementing elliptic curve cryptography”, Greenwich, CT: Manning publications, 1999.
  10. William Stallings, “A text book of Cryptography and Network security”, Principles and practices, Pearson education, fourth edition, 2007.
Index Terms

Computer Science
Information Sciences

Keywords

Elliptic Curve Cryptography Public-key Secret key Encryption Decryption