Key generation for plain text in stream cipher via bi-objective evolutionary computing

Abstract Evolutionary algorithms are widely used to solve a wide variety of continuous, discrete and combinatorial optimization problems. Evolutionary multi-objective optimization problems seek Pareto front in order to negotiate the trade-off amongst various objective functions present in the problem. Much of the literature on cryptography focuses on making the inference problem harder, for securing the content. In this paper, we developed key generation algorithms using Non-Dominated Sorting Genetic Algorithm-II (NSGA-II) in the bi-objective optimization framework and Improved Modified Harmony Search + Differential Evolution (IMHS+DE), Differential Evolution (DE) and Improved Modified Harmony Search (IMHS), in the single objective optimization framework. For encoding the keystream thus generated as well as the plain text we employed the Mutated Huffman Tree Coding algorithm. In the next phase, we encrypted the encoded keystream as well as the encoded plain text in order to generate the cipher text. We then decrypted the cipher text using the encoded key stream followed by the decoding of the deciphered text using the code tables. Following the literature, we generated random texts of varying lengths and code table sizes in order to demonstrate the effectiveness of our proposed method. The proposed algorithms are compared with the extant methods. In the case of bi-objective optimization set up, we also plotted the empirical attainment function (EAF) surface to summarize the effectiveness of the NSGA-II based key generation algorithm. Of particular significance is the highest entropy value yielded by the NSGA-II based algorithm, which in turn indicates the strength of the key generated by the NSGA-II.

[1]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[2]  Carlos M. Fonseca,et al.  On the Computation of the Empirical Attainment Function , 2011, EMO.

[3]  Steven M. Bellovin,et al.  Frank Miller: Inventor of the One-Time Pad , 2011, Cryptologia.

[4]  Benjamin Ferriman.  Cryptanalysis of the RC4 Stream Cipher using Evolutionary Computation Methods , 2013 .

[5]  Wasan Shaker Awad.  On the Application of Evolutionary Computation Techniques in Designing Stream Cipher Systems , 2011 .

[6]  G. A. Vijayalakshmi Pai,et al.  Stream cipher for binary image encryption using Ant Colony Optimization based key generation , 2012, Appl. Soft Comput..

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

[8]  Marin Golub,et al.  On evolutionary computation methods in cryptography , 2011, 2011 Proceedings of the 34th International Convention MIPRO.

[9]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[10]  Emmanouil Kalligeros,et al.  Optimal Selective Huffman Coding for Test-Data Compression , 2007, IEEE Transactions on Computers.

[11]  G. A. Vijayalakshmi Pai,et al.  Swarm intelligence based key generation for text encryption in cellular networks , 2008, 2008 3rd International Conference on Communication Systems Software and Middleware and Workshops (COMSWARE '08).

[12]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.

[13]  Bin Zhang,et al.  Improved Key Recovery Attacks on Reduced-Round Salsa20 and ChaCha , 2012, ICISC.

[14]  Pedro Isasi Viñuela,et al.  On the design of state-of-the-art pseudorandom number generators by means of genetic programming , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[15]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[16]  Safya Belghith,et al.  Joint compression and encryption using chaotically mutated Huffman trees , 2010 .

[17]  Michael N. Vrahatis,et al.  Cryptography and Cryptanalysis Through Computational Intelligence , 2007, Computational Intelligence in Information Assurance and Security.

[18]  K. P. Subbalakshmi,et al.  Cryptanalysis of Some Multimedia Encryption Schemes , 2008, IEEE Transactions on Multimedia.

[19]  M.Y. Javed,et al.  A Performance Comparison of Data Encryption Algorithms , 2005, 2005 International Conference on Information and Communication Technologies.

[20]  Pedro Isasi,et al.  Introduction to the Applications of Evolutionary Computation in Computer Security and Cryptography , 2004 .

[21]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[22]  Yong Zeng,et al.  Pseudorandom number generators based on evolutionary algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[23]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[24]  Subariah Ibrahim,et al.  A Review on Biological Inspired Computation in Cryptology , 2005 .

[25]  William Stallings,et al.  Cryptography and Network Security: Principles and Practice , 1998 .

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

[27]  Ioannis Andreadis,et al.  Comparison between cellular automata and linear feedback shift registers based pseudo-random number generators , 1997, Microprocess. Microsystems.

[28]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[29]  Carlos M. Fonseca,et al.  Exploring the Performance of Stochastic Multiobjective Optimisers with the Second-Order Attainment Function , 2005, EMO.

[30]  Simon Y. Foo,et al.  Evolving ant colony systems in hardware for random number generation , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[31]  Steven Guan,et al.  An evolutionary approach to the design of controllable cellular automata structure for random number generation , 2003, IEEE Trans. Evol. Comput..

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

[33]  A. Rukhin,et al.  Statistical Testing of Random Number Generators , 1999 .

[34]  William Millan,et al.  Evolutionary Heuristics for Finding Cryptographically Strong S-Boxes , 1999, ICICS.

[35]  Pedro Isasi Viñuela,et al.  Evolutionary Computation in computer security and cryptography , 2005, New Generation Computing.

[36]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[37]  Iwona Polak,et al.  Genetic Algorithm in Stream Cipher Cryptanalysis , 2015, ICCCI.

[38]  G. A. Vijayalakshmi Pai,et al.  Swarm intelligence based key generation for stream cipher , 2011, Secur. Commun. Networks.

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

[40]  Vadlamani Ravi,et al.  Modified Harmony Search Applied to Reliability Optimization of Complex Systems , 2015, ICHSA.