We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Reseach Article

Improving Efficiency of Basic Encryption and Authentication Technique using Elliptic Curve with Parameterized Hash Algorithm

by Usha Chouhan, Mohsin Sheikh, Prateek Nahar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 82 - Number 18
Year of Publication: 2013
Authors: Usha Chouhan, Mohsin Sheikh, Prateek Nahar
10.5120/14260-2077

Usha Chouhan, Mohsin Sheikh, Prateek Nahar . Improving Efficiency of Basic Encryption and Authentication Technique using Elliptic Curve with Parameterized Hash Algorithm. International Journal of Computer Applications. 82, 18 ( November 2013), 1-3. DOI=10.5120/14260-2077

@article{ 10.5120/14260-2077,
author = { Usha Chouhan, Mohsin Sheikh, Prateek Nahar },
title = { Improving Efficiency of Basic Encryption and Authentication Technique using Elliptic Curve with Parameterized Hash Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { November 2013 },
volume = { 82 },
number = { 18 },
month = { November },
year = { 2013 },
issn = { 0975-8887 },
pages = { 1-3 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume82/number18/14260-2077/ },
doi = { 10.5120/14260-2077 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:58:02.948011+05:30
%A Usha Chouhan
%A Mohsin Sheikh
%A Prateek Nahar
%T Improving Efficiency of Basic Encryption and Authentication Technique using Elliptic Curve with Parameterized Hash Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 82
%N 18
%P 1-3
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In present era, mostly data sends via the internet for sharing, so the reliability on data is decreased. To maintain reliability, several kinds of security and authentication is mechanisms needed, less security increase the liability of attacks on data. Digital Signature of the data is a solution to this security problem which provides the reliability, authenticity and accuracy. Most basic algorithm for security and authentication is RSA, DSA, ECDSA algorithms which uses the different key of different sizes. This paper presents elliptic curve algorithm to encrypt the data and use parameterized hash algorithm to authenticate the data.

References
  1. Zhu Na and GuoXi Xiao 2008. The Application of a Scheme of Digital Signature in Electronic Government
  2. Lawrence E. Bassham III March 2004. The Digital Signature Algorithm Validation System (DSAVS). National Institute of Standards and Technology Information Technology Laboratory Computer Security Division
  3. Wei Haiping and Jia Chuanying 2007. The Study of Password Authentication System Based on Elliptic Curve Cryptosystem Navigation college, Dalian Maritime University Dalian,Liaoning 116026,China Liaoning Shihua University Fushun,Liaoning 113001,China IEEE.
  4. Michael J. Wiener 1998. Performance comparision of public key cryptosystems" Entrust Technologies,canada, RSA Laboratories Vol. 4,No. 1,1998.
  5. P. Rodwald and J. Stok?osa, PHAL-256 - Parameterized Hash Algorithm. Proceedings of the Fourth International Conference onInformation Assurance and Security, IEEE Computer Society Press, Naples, Italy, 2008.
  6. Stuart Haber, Burt Kaliski and Scott Stornetta . How do digital timestamps support digital signatures, CryptoBytes, Vol. 1, No. 3, RSA Laboratories, 1995, pp. 14-15.
  7. Johnson, D. B , Menezes and A. J 2007. Elliptic Curve DSA (ECDSA): An Enhanced DSA. Scientific Commons.
  8. Zhenfeng zhang and Dengguo feng, Key Replacement attack on a certificateless signature scheme, State Key laboratory of information security, chinese academy of science,Beijing.
Index Terms

Computer Science
Information Sciences

Keywords

RSA ECDSA Hash Functions PHAL Digital Time Stamping.