Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary


Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,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, ,
Affiliations
Department of Computer Science and Engineering North Eastern Regional Institute of Science and Technology Arunachal Pradesh, INDIA
:10.22362/ijcert/2016/v3/i11/48907


Abstract
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.


Citation
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

References
[1]	Anoop MS “Elliptic Curve Cryptography-An Implementation Guide” anoopms@tataelxsi.co.in.
[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: http://www.comp.nus.edu.sg/~jervis /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 : http://www.dx.doi.org/10.22362/ijcert/2016/v3/i11/48907

Download :
  V3I1101.pdf


Refbacks : There are currently no refbacks

Announcements


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events


Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.


Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.


IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert


IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)


Emerging Sources Citation Index (in process)


IJCERT title is under evaluation by Scopus.


Key Dates


☞   INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞   LAST DATE OF SUBMISSION : 31st March 2023
☞  SUBMISSION TO FIRST DECISION :
In 7 Days
☞  FINAL DECISION :
IN 3 WEEKS FROM THE DAY OF SUBMISSION

Important Announcements


All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index


Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)


Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links



Conference Proposal




DOI:10.22362/ijcert