Public Key Cryptography Using Harmony Search Algorithm

Privacy is a very important requirement for viability of modern information sharing through cyberspace and the modern cryptology is ensuring success. Harmony Search Algorithm (HSA) is a new meta-heuristic computation technique inspired from musical improvisation techniques, where searching for a perfect harmony is the objective of this technique. Public Key Cryptography heavily relies on key pairs which are large prime numbers. Our adaptation of the HSA tries to provide a fast key generation mechanism with a feasible implementation. The keys are ranked based on their harmony and the best harmony is selected as the result of the search which in turn is used to generate the key pair of RSA, a Public Key Cryptography technique as a test of effectiveness and success.

[1]  Mohammad Sharifkhani,et al.  A novel approach for secure and fast generation of RSA public and private keys on SmartCard , 2010, Proceedings of the 8th IEEE International NEWCAS Conference 2010.

[2]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[3]  M. Rabin.  Probabilistic algorithm for testing primality , 1980 .

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[6]  Christopher M. Bishop,et al.  Neural networks for pattern recognition , 1995 .

[7]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[8]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[9]  James R. Nechvatal.  Public-Key Cryptography , 1991 .

[10]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[11]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[12]  John A. Clark,et al.  A Survey of Authentication Protocol Literature , 2010 .

[13]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[14]  John A. Clark,et al.  Automated Design of Security Protocols , 2004, Comput. Intell..

[15]  Richard Spillman,et al.  Use of a genetic algorithm in the crypt-analysis of simple substitution ciphers , 1993 .

[16]  Siddharth Bali,et al.  Public key cryptography using neural networks and genetic algorithms , 2013, 2013 Sixth International Conference on Contemporary Computing (IC3).

[17]  Claude E. Shannon,et al.  Prediction and Entropy of Printed English , 1951 .

[18]  Kaushal K. Shukla,et al.  A Study on the Limitations of Evolutionary Computation and other Bio-inspired Approaches for Integer Factorization , 2015, SCSE.

[19]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[20]  Vinod Patidar,et al.  A Pseudo Random Bit Generator Based on Chaotic Logistic Map and its Statistical Testing , 2009, Informatica.