000			01599nam a22001817a 4500
003			OSt
005			20220107122810.0
008			160328b xxu||||| |||| 00| 0 eng d
040			_c
100			_aNishant kashyap (93613023) _98725
245			_aCryptanalysis of Classical Cryptosystems via Metaheuristics
502			_bMaster of Science in Computer Science and Information security _c2013-2015 _dEXT _eTony Thomas _fAruna Tiwari (Assistant Professor) _g"IIT Indore"
520			_aBrute force search is impractical when the search space is large (for instance, consider a binary space that has 2n m-tuples, it is impractical to do brute force if n is greater than or equal to 5). In literature, search heuristics (meta-heuristics) have shown promising results for the cryptanalysis of classical ciphers. In this project, we propose, implement and test new heuristics that are proposed for cryptanalysis of simple substitution cipher and columnar transposition cipher. The proposed heuristics are based on the Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Cuckoo Search (CS). For verifying efficiency of proposed heuristics, the experiments are conducted. The cryptanalytic results obtained via proposed heuristics are better than the results previously reported in literature. In case of simple substitution cipher, GA has shown better performance than PSO and CS. In case of simple substitution cipher, CS has shown better performance than GA and PSO.
650			_aINFORMATION SYSTEMS _98726
650			_aINFORMATION SECURITY _98727
650			_aCRYPTOLOGY _98728
942			_2ddc _cPR
999			_c5037 _d5037