CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Multiplication Based Elliptic Curve Encryption Scheme with Optimized Scalar Multiplication (MECES)

by V.S.Shankar Sriram, S.Dinesh, G.Sahoo
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 11
Year of Publication: 2010
Authors: V.S.Shankar Sriram, S.Dinesh, G.Sahoo
10.5120/239-393

V.S.Shankar Sriram, S.Dinesh, G.Sahoo . Multiplication Based Elliptic Curve Encryption Scheme with Optimized Scalar Multiplication (MECES). International Journal of Computer Applications. 1, 11 ( February 2010), 65-70. DOI=10.5120/239-393

@article{ 10.5120/239-393,
author = { V.S.Shankar Sriram, S.Dinesh, G.Sahoo },
title = { Multiplication Based Elliptic Curve Encryption Scheme with Optimized Scalar Multiplication (MECES) },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 11 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 65-70 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number11/239-393/ },
doi = { 10.5120/239-393 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:46:04.523596+05:30
%A V.S.Shankar Sriram
%A S.Dinesh
%A G.Sahoo
%T Multiplication Based Elliptic Curve Encryption Scheme with Optimized Scalar Multiplication (MECES)
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 11
%P 65-70
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Elliptic Curve Cryptography (ECC) fits well for an efficient and secure encryption scheme. It is efficient than the ubiquitous RSA based schemes because ECC utilizes smaller key sizes for equivalent security. This feature of ECC enables it to be applied to Wireless networks where there are constraints related to memory and computational power. The goal of this research is to develop an efficient method for Scalar Multiplication and to develop simple and efficient encryption scheme. In this paper we have compared the security of Elliptic curve AES (ECAES) with the Encryption scheme proposed by us. A comparative study of ECC with RSA is made in terms of key size, computational power, size of data files and encrypted files.

References
  1. Jia Xiangyu,Wang Chao "The Application of Elliptic Curve Cryptosystem in Wireless Communication" 2005 IEEE International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications Proceedings.
  2. Abdullah, M., Bellare, M. and Rogaway, P, "DHAES:an encryption scheme based on the Diffie-Hellman problem". Contribution to IEEE P1363. 1998.
  3. N. Koblitz, "Elliptic curve cryptosystems", Mathematics of Computation, vol. 48, pp. 203-209, 1987.
  4. Vipul Gupta,Douglas Stebila,Sheueling Chang Shantz ,"Integrating Elliptic Curve Cryptography into the Web's Security Infrastructure".
  5. G.V.S. Raju and Rehan Akbani." Elliptic Curve Cryptosystem and its Applications ".0-7803-7952-7/03/$17.00 0 2003 IEEE.
  6. Certicom White Papers ,"THE ELLIPTIC CURVE CRYPTOSYSTEM FOR SMART CARDS ".
  7. Guide to Elliptic Curve Cryptography - D. Hankerson.
  8. Bruce Schneier - Applied Cryptography, Second Edition - John Wiley & Sons [ISBN0471128457]
  9. MIT Press Handbook of Applied Cryptography.
  10. W. Stallings," Cryptography and Network Security", Prentice Hall, Second Edition,1998.
  11. Handbook of Elliptic and Hyperelliptic Curve Cryptography by Henri Cohen and Gerhard Frey.
  12. M.Aydos, B.Sunar, and C.K.Koc ,"An Elliptic Curve Cryptography based Authentication and Key Agreement Protocol for Wireless Communication" .2nd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Dallas, Texas, October 30, 1998.
  13. D. M. Gordon, "A Survey of fast exponentiation methods," J. Algorithms, 27, 1998,pp. 129-146.
  14. Y. Han, P. Lmng, P. Tan, and J. Zhang, "Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field," Advances in Cryptology- CRYPT0'99, LNCS 1716, pp.75-85.
  15. Daniel J. Bernstein, Peter Birkner, Tanja Lange, and Christian Peters, "Optimizing double-base elliptic-curve single-scalar multiplication" .
Index Terms

Computer Science
Information Sciences

Keywords

Elliptic Curve Cryptography Security

Powered by PhDFocusTM