Impact Factor:6.549
 Scopus Suggested Journal: Tracking ID for this title suggestion is: 55EC484EE39417F0

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

Multiple Encryption using ECC and Its Time Complexity Analysis

Vishal Kumar, Ratnesh Kumar, Mashud A. Barbhuiya and Monjul Saikia, ,
Department of Computer Science and Engineering North Eastern Regional Institute of Science and Technology Arunachal Pradesh, INDIA

Rapid growth of information technology in present era, secure communication, strong data encryption technique and trusted third party are considered to be major topics of study. Robust encryption algorithm development to secure sensitive data is of great significance among researchers at present. The conventional methods of encryption used as of today may not sufficient and therefore new ideas for the purpose are to be design, analyze and need to be fit into the existing system of security to provide protection of our data from unauthorized access. An effective encryption/ decryption algorithm design to enhance data security is a challenging task while computation, complexity, robustness etc. are concerned. The multiple encryption technique is a process of applying encryption over a single encryption process in a number of iteration. Elliptic Curve Cryptography (ECC) is well known and well accepted cryptographic algorithm and used in many application as of today. In this paper, we discuss multiple encryptions and analyze the computation overhead in the process and study the feasibility of practical application. In the process we use ECC as a multiple-ECC algorithm and try to analyze degree of security, encryption/decryption computation time and complexity of the algorithm. Performance measure of the algorithm is evaluated by analyzing encryption time as well as decryption time in single ECC as well as multiple-ECC are compared with the help of various examples.

Vishal Kumar et al. ," Multiple Encryption using ECC and Its Time Complexity Analysis”, International Journal of Computer Engineering In Research Trends, 3(11):568-572,November-2016.

Keywords : ECC, Koblitz Method, Multiple Encryption, Message Encoding, Decryption etc

[1]	Anoop MS “Elliptic Curve Cryptography-An Implementation Guide”
[2]	Himanshu Gupta and Vinod Kumar Sharma "Multiphase Encryption: A New Concept in Modern Cryptography" IJCTE 2013 Vol.5(4): 638-640 ISSN: 1793-8201 DOI: 10.7763/IJCTE.2013.V5.765 is referred. 
[3]	William Stalling “Cryptography and Network Security” book (fourth edition).
[4]	N. Koblitz. “A Course in Number Theory and Cryptography”, Springer-Verlag, second edition, 1994.
[5]	W. Diffie and M. Hellman, “Exhaustive Cryptanalysis of the NBS Data Encryption Standard”, June 1977, pp. 74-84.
[6]	NIST Special Publication 800-78-2, “Cryptographic Algorithms and Key Sizes for Personal Identity Verification”, February 2010. 
[7]	Darrel Hankerson, Julio Lopez Hernandez, Alfred Menezes, “Software Implementation of Elliptic Curve Cryptography over Binary Fields”, 2000 
[8]	M. Brown, D. Hankerson, J. Lopez, A. Menezes, “Software Implementation of the NIST Elliptic Curves Over Prime Fields”, 2001
[9]	Certicom, “Standards for Efficient Cryptography, SEC 1: Elliptic Curve Cryptography”, Version 1.0, September 2000
[10]	Certicom, “Standards for Efficient Cryptography, SEC 2: Recommended Elliptic Curve Domain Parameters”, Version 1.0, September 2000, 
[11]	Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, “Handbook of Applied Cryptography”, CRC Press, 1996
[12]	Data Security for e-Transaction. Retrieved on April 12th 2008, from Weblink: /cs3235/set.html
[13]	Ralph C. Merkle, Martin E. Hellman, “On the Security of Multiple Encryption, A technical note on Programming Technique & Data Structure” published in ACM, 1981, Volume 24, Number 7.
[14]	M. Saikia, S.J. Bora, Md. A. Hussain “A Review on Applications of Multimedia Encryption” in ISBN: 987-81-8487-088-6 in national conference on Network Security- issues 2010, Tezpur University
[15]	Vandana Thakur, Monjul Saikia "Comprehensive Survey of Multimedia Encryption Techniques" 26th National Conv. of Comp. Eng. held at the IEI (India), Assam February 4, 2012
[16]	Boruah, Debabrat; Saikia, Monjul, "Implementation of ElGamal Elliptic Curve Cryptography over prime field using C," International Conference on Information Communication and Embedded Systems (ICICES), 2014, vol., no., pp.1,7, 27-28 Feb. 2014
[17]	Kapoor, Vivek, Vivek Sonny Abraham, and Ramesh Singh. "Elliptic curve cryptography." Ubiquity 2008.May (2008): 7.
[18]	Merkle, Ralph C., and Martin E. Hellman. "On the security of multiple encryption." Communications of the ACM 24.7 (1981): 465-467.
[19]	Dahl, Ulf. "Data security system for a database having multiple encryption levels applicable on a data element value level." U.S. Patent No. 6,321,201. 20 Nov. 2001.
[20]	Zhang, Linhua. "Cryptanalysis of the public key encryption based on multiple chaotic systems." Chaos, Solitons & Fractals 37.3 (2008): 669-674.
[21]	Raju, G. V. S., and Rehan Akbani. "Elliptic curve cryptosystem and its applications." Systems, Man and Cybernetics, 2003. IEEE International Conference on. Vol. 2. IEEE, 2003.
[22]	Önen, Melek, and Refik Molva. "Secure data aggregation with multiple encryption." European Conference on Wireless Sensor Networks. Springer Berlin Heidelberg, 2007.
[23]	Bhati, Sunita, Anita Bhati, and S. K. Sharma. "A New Approach towards Encryption Schemes: Byte–Rotation Encryption Algorithm." Proceedings of the World Congress on Engineering and Computer Science. Vol. 2. 2012.

DOI Link :

Download :

Refbacks : There are currently no refbacks

Support Us

We have kept IJCERT is a free peer-reviewed scientific journal to endorse conservation. We have not put up a paywall to readers, and we do not charge for publishing. But running a monthly journal costs is a lot. While we do have some associates, we still need support to keep the journal flourishing. If our readers help fund it, our future will be more secure.

Quick Links


Science Central

Score: 13.30

Submit your paper to