Natural Heuristics for Cryptanalysis
T. Mekhaznia
Journal of Information Security Research, Vol. 3, No. 2, 2012.
DOI: 
Link: http://www.dline.info/jisr/fulltext/v3n2/4.pdf
Abstract:
Natural Metaheuristics have been widely used to solve difficult optimization problems. This is mainly due to their ability to converge in reasonable time. However, they remain inefficient where handling large instances. Current research tends to improve these techniques in order to produce hybrid algorithms able to solve these problems. The encryption information has long been a challenge for cryptanalysis. It was always attacked by classical techniques and heuristics but results are limited. In this paper, an approach of a PSO algorithm was proposed for cryptanalysis of classical encryption. After comparison with other heuristics in the same category, we show experimentally the superiority of PSO on the instances tested and underline the difficulties encountered.