BAT algorithm for Cryptanalysis of Feistel cryptosystems

Year 2015, , 82 - 85, 01.04.2015

Mekhaznia Tahar

https://doi.org/10.18201/ijisae.82426

Cited By: 2

Abstract

Recent cryptosystems constitute an effective task for cryptanalysis algorithms due to their internal structure based on nonlinearity. This problem can be formulated as NP-Hard. It has long been subject to various attacks; available results, emerged many years ago remain insufficient when handling large instances due to resources requirement which increase with the amount of processed data.  On another side, optimization techniques inspired by swarm intelligence represents a set of approaches used to solve complex problems. This is mainly due to their fast convergence with a consumption of reduced resources. The purpose of this paper is to provide, and for a first time, a more detailed study about the performance of BAT algorithm in cryptanalysis of some variant of Data encryption standard algorithms. Experiments were performed to study the effectiveness of the used algorithm in solving the considered problem and underline the difficulties encountered.

Keywords

Cryptanalysis, Feistel ciphers, bat algorithm

References

• S. Rao & al. (2009). Cryptanalysis of a Feistal Type Block Cipher by Feed Forward Neural Network Using Right Sigmoidal Signals. International Journal of Software Computing, Vol.4(3).
• S.Ali K, Al-Omari Putra Sumari. (2010). Spiking Neurons with ASNN BASED-Methods for the Neural Block Cipher. International journal of computer science & information Technology. Vol.2(4).
• R. Singh, D. B. Ojha. (2010). An Ordeal Random Data Encryption Scheme (ORDES). International Journal of Engineering Pages.6349- 6360. Technology. Vol. 2(11).
• C. Blum, X. Li, (2007). Swarm intelligence in optimization’, natural Computing Series, Springer.
• T.S.C. Felix, M.K. Tiwari. (2007). Swarm Intelligence, Focus on Ant Particle Swarm Optimization. Int. Tech Education and Publishing..978-902613-09-7.Austria.
• A. Gherboudj, S. Chikhi. (2011). A modified HPSO Algorithms for Knapsack Problem. CCIS. Springer.
• G.S. Sharvani, N.K. Cauvery, T.M. Rangaswamy. (2009). Different Types of Swarm Intelligence Algorithm for Routing. International Conference on Advances in Recent Technologies in Communication and Computing.
• Beni, G., Wang, J. (1989). Swarm Intelligence in Cellular Robotic Systems, Proceed. NATO Advanced Workshop on Robots and Biological Systems, Tuscany, Italy.
• J. Olamaei, T. Niknam, G. Gharehpetian. (2008). Application of particle swarm optimization for distribution feeder reconfiguration considering distributed generators. AMC. Pages 575-586.
• X. S. Yang. (2010). A New Metaheuristic Bat-Inspired Algorithm. Nature Inspired Cooperative Strategies for Optimization.
• D. R. Griffin. (1958). Listening in the dark. Yale Univ. Press. New York.
• J. R,. Speakman, P. A. Racey. (1991). The cost of being a bat. Nature. V 350. Pages. 421−423
• S. Ghorui & al. (2000). A simpler and elegant algorithm for computing fractal dimension in higher dimensional state space. PRAMANA Journal of Physics. Indian Academy of Sciences. Vol 54(2), L331–L336.
• W. Stallings. (2008). Cryptography and Network Security Principles and Practices. Pearson Education.
• A. B. Forouzan. (2008). Cryptography and Network Security. Tata McGraw hill Education, 2nd ed.
• E.C. Laskari & al. (2005). Evolutionary computation based cryptanalysis: A first study. Nonlinear Analysis: Theory, Methods and Applications. Vol. 63. Pages. e823–e830.
• E. Schaefer. (1996). A Simplified Data Encryption Standard Algorithm. Cryptologia. Vol. 20(1). Pages. 77-84.
• Robert, L. (2000). Cryptological Mathematics. The Mathematical Association of America. NY.
• Nelson, G., Wallis, G. and Bas, A. (2000). Exploring Natural Languag: Working with the British Component of the International Corpus of English. John Benjamins Publishing Company. Amsterdam.
• Singh, S. (1999). The code book: The Evolution of Secrecy from Mary, Queen of Scots, to Quantum Cryptography. Doubleday. New York, NY, USA, 1st edition.
• Beker, H. and Piper, F. (1982). Cipher Systems: The Protection of Communications. John Wiley & Sons.
• Jakobsen, T. and Knudsen, L.R. (2001). Attacks on block ciphers of low algebraic degree. J. of Cryptology. Vol. 14(3). Pages. 197-210.
• Nalini, N. and Raghavendra, G. (2006). Cryptanalysis of Simplified Data Encryption Standard via Optimisation Heuristics. Int. J. of Computer Science and Network Security. Vol. 6(1B). Pages.240-246.
• Verma, A. K., Dave, M. and Joshi. R. C. (2007). Genetic Algorithm and Tabu Search Attack on the MonoAlphabetic Subsitution Cipher in Adhoc Networks. Journal of Computer Science. Vol. 3 (3). Pages. 134-137.
• Ganapathi, S. and Purusothaman, T. (2011). Reduction of Key Search Space of Vigenere Cipher Using Particle Swarm Optimization. J. of Computer Science. Vol 7(11). Pages. 1633-1638.