An Artificial Life Technique for the Cryptanalysis of Simple Substitution Ciphers

In this paper, we investigate the use of ant colony optimization (ACO) for automated cryptanalysis of classical simple substitution ciphers. Based on our experiments, ACO-based attacks proved to be very effective on various sets of encoding keys

[1]  Michael Lucks,et al.  A Constraint Satisfaction Algorithm for the Automated Decryption of Simple Substitution Ciphers , 1988, CRYPTO.

[2]  Azriel Rosenfeld,et al.  Breaking substitution ciphers using a relaxation algorithm , 1979, CACM.

[3]  Reihaneh Safavi-Naini,et al.  Automated Cryptanalysis of Substitution Ciphers , 1993, Cryptologia.

[4]  J. Deneubourg,et al.  Trails and U-turns in the Selection of a Path by the Ant Lasius niger , 1992 .

[5]  SpillmanRichard,et al.  Use of a genetic algorithm in the cryptanalysis of simple substitution ciphers , 1993 .

[6]  Susan Stepney,et al.  Making the most of two heuristics: breaking transposition ciphers with ants , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[7]  George W. Hart.  To decode short cryptograms , 1994, CACM.

[8]  Dennis R. Bahler,et al.  An Implementation of Probabilistic Relaxation in the Cryptanalysis of Simple Substitution Ciphers , 1992, Cryptologia.

[9]  John M. Carroll,et al.  The Automated Cryptanalysis of Substitution Ciphers , 1986, Cryptologia.

[10]  D. Kahn.  The codebreakers : the story of secret writing , 1968 .

[11]  Andrew Clark,et al.  Optimisation heuristics for cryptology , 1998 .

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

[13]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..