Authentication and Encryption Using Modified Elliptic Curve Cryptography with Particle Swarm Optimization and Cuckoo Search Algorithm
Elliptic Curve Cryptography (ECC) uses two keys private key and public key and is considered as a public key cryptographic algorithm that is used for both authentication of a person and confidentiality of data. Either one of the keys is used in encryption and other in decryption depending on usage. Private key is used in encryption by the user and public key is used to identify user in the case of authentication. Similarly, the sender encrypts with the private key and the public key is used to decrypt the message in case of confidentiality. Choosing the private key is always an issue in all public key Cryptographic Algorithms such as RSA, ECC. If tiny values are chosen in random the security of the complete algorithm becomes an issue. Since the Public key is computed based on the Private Key, if they are not chosen optimally they generate infinity values. The proposed Modified Elliptic Curve Cryptography uses selection in either of the choices; the first option is by using Particle Swarm Optimization and the second option is by using Cuckoo Search Algorithm for randomly choosing the values. The proposed algorithms are developed and tested using sample database and both are found to be secured and reliable. The test results prove that the private key is chosen optimally not repetitive or tiny and the computations in public key will not reach infinity.
KeywordsECC Private key, Public key Public key cryptographic algorithm (PKC) Particle swarm optimization (PSO) Cuckoo search algorithm (CS)
We thank DST, New Delhi and GITAM (Deemed to be University) for providing resources to carryout the work under FIST Project No. SR/FST/ETI-341/2013, dated September 10, 2014.
- 2.V.S. Miller, in Use of Elliptic Curves in Cryptography, ed. by H.C. Williams Advances in Cryptology—CRYPT0 ‘‘5, LNCS 218, pp. 417–426, 1986Google Scholar
- 3.J.L. Fernandez-Marquez, J.L. Arcos, in Adapting Particle Swarm Optimization in Dynamic and Noisy Environments, Evolutionary Computation (CEC), 2010 IEEE, Barcelona 18–23 July 2010, pp 1–8, IEEEGoogle Scholar
- 7.M. Wang, G. Dai, H. Hu, L. Pen, in Selection of Security Elliptic Curve Based on Evolution Algorithm; Computational Intelligence and Natural Computing, 2009. CINC ‘‘9. International Conference on (volume:1) on 6–7 June 2009; pp 55–57Google Scholar
- 8.J. Kennedy, R. Eberhart, in Particle Swarm Optimization; Neural Networks, 1995. Proceedings, IEEE International Conference on (Volume:4) on Nov/Dec 1995; pp. 1942–1948Google Scholar
- 9.P.J. Angeline, in Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences. 7th International Conference, EP98 San Diego, California, USA, March 25–27, 1998 Proceedings, Springer Berlin Heidelberg, pp 601–610Google Scholar
- 10.X.-S. Yang, S. Deb, in Cuckoo Search via Levy Flights. Proceedings of World Congress on Nature & Biologically Inspired Computing (NaBIC 2009), India. IEEE Publications, USA, Dec 2009Google Scholar
- 11.L.D. Singh, K.M. Singh, in Implementation of Text Encryption using Elliptic Curve Cryptography. Eleventh International Multi-Conference on Information Processing-2015 (IMCIP-2015), ElsevierGoogle Scholar
- 12.S. Maria Celestin Vigila, K. Muneeswaran, in Implementation of Text based Cryptosystem using Elliptic Curve Cryptography. International Conference on Advanced Computing IEEE (2009), pp. 82–85Google Scholar
- 13.M. Amara, A. Siad, in Elliptic Curve Cryptography and its Applications, Systems, Signal Processing and their Applications (WOSSPA). 2011 7th International Workshop on 9–11 May 2011; pp. 247–250Google Scholar
- 14.K. Sujatha, P.V. Nageswara Rao, A. Arjuna Rao, L.V. Rajesh, Renowned information security algorithms: a comparative study. Int. J. Eng. Res. Technol. 5(02). ISSN: 2278–0181Google Scholar
- 15.K. Sujatha, P.V. Nageswara Rao, A. Arjuna Rao, P.S.V.D. Prasad, P. Someswari, Reliable verified internet voting system based on modified elliptic curve cryptography. Int. J. Appl. Eng. Res. 11(3), 1874–1878 (2016)Google Scholar