Abstract

In this paper presents the Linear Cryptanalysis on S-DES and Symmetric Block Ciphers Using Hill Cipher Method. As a vehicle of demonstration of this concept, choose simple yet representative block ciphers such as computationally tractable versions of S-DES, for the studies. The attack presented in this paper is applicable to block structure independently of the key scheduling. The attack needs distinct known plaintexts which are a more realistic attack model in comparison with impossible differential cryptanalysis which uses chosen plaintext pairs. Moreover, linear cryptanalysis on simplified data encryption standard performed simulations on a small variant block and present the experimental results on the theoretical model of the multidimensional linear cryptanalysis using Hill Cipher method.

References

• Rajashekarappa, Dr K M Sunjiv Soyjaudah, 2012, ICIP, Cryptanalysis of Simplified-Data Encryption Standard Using Tabu Search Method, pp. 561-568, ©Springer-Verlag Berlin Heidelberg.
• Biham, E. , and Shamir, A, 1993, Differential Cryptanalysis of the Data Encryption Standard. NewYork: Springer-Verlag.
• Comppersmith, D, May, 1994, "The Data Encryption Standard (DES) and Its Strength Against Attacks", IBM Journal of Research and Development.
• Matsui, M,1993, "Linear Cryptanalysis Method for DES Cipher. " Proceedings, EUROCRYPT '93, published by Springer-Verlag.
• Barker, W, 1991,Introduction to the Analysis of the Data Encryption Standard (DES). Laguna Hills, CA: Aegean Park Press.
• Electronic Frontier Foundation, 1998, Cracking DES: Secrets of Encryption Research,Wiretap Politics, and Chip Design. Sebastopol, CA: O'Reilly.
• BibhudendraAcharya, GirijaSankarRath, Sarat Kumar Patra, Saroj Kumar Panigrahy, 2007, "Novel Methods of Generating Self-Invertible Matrix for Hill Cipher Algorithm", International Journal of Security, Vol 1, Issue 1, pp. 14-21.
• William Stallings, 1989, "Cryptography and Network Security Principles and Practices", Fourth edition, McGraw- Hill, 2003. M. Young, The Technical Writer's Handbook. Mill Valley, CA: University Science.
• Behrouz A. Forouzan, 2006, "Cryptography and Network Security", Firstedition, McGraw- Hill.
• Atul Kahate, 2003, "Cryptography and Network Security", TMH.
• Rajashekarappa and Dr. K M S Soyjaudah, 2012, "Heuristic Search Procedures for Cryptanalysis and Development of Enhanced Cryptographic Techniques" Published at International Journal of Modern Engineering Research (IJMER), Vol. 2, Issue. 3, pp-949-954.
• Poonam, G, 2009, "Crypatanalysis of SDES via Evolutionary Computation Techniques". International Journal of Computer Science and Information Security 1(1).
• Chanas, S. , Kobylanski, P, 1996, A New Heuristic Algorithm Solving the Linear Ordering Problem. Computational Optimization and Applications 6, 191–205.
• Ayman M. B. Albassal, Abdel-Moneim A. Wahdan, 2004, Genetic Algorithm Cryptanalysis of a Fiestel Type Block Cipher, International Conference on Electrical, Electronic and Computer Engineering, Egypt, PP. 217–221.
• Garg, P, 2010, Evolutionary Computation Algorithms for Cryptanalysis: A Study, (IJCSIS) International Journal of Computer Science and Information Security,Vol. 7, No. 1.
• Coppersmith, D, 1994, "The Data Encryption Standard (DES) and Its Strength Against Attacks. " IBM Journal of Research and Development.
• Rajashekarappa, Dr K M Sunjiv Soyjaudah, 2012, Comparative Cryptanalysis of Simplified-Data Encryption Standard Using Tabu Search and Simulated Annealing Methods, International Journal of Engineering Research and Development, pp. 07-12.