Modern optimisation algorithms for cryptanalysis
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 220, 258-262
- https://doi.org/10.1109/anziis.1994.396969
Abstract
In recent years a number of optimisation algorithms have emerged which have proven to be effective in solving a variety of NP-complete problems. Examples of such methods include simulated annealing, genetic algorithms and the tabu search. This paper describes each of these three algorithms and overview their use in the held of cryptology. In particular, the application to cryptanalysis of simple substitution and transposition ciphers is considered.<>Keywords
This publication has 6 references indexed in Scilit:
- AUTOMATED CRYPTANALYSIS OF SUBSTITUTION CIPHERSCryptologia, 1993
- THE USE OF GENETIC ALGORITHMS IN CRYPTANALYSISCryptologia, 1993
- USE OF A GENETIC ALGORITHM IN THE CRYPTANALYSIS OF SIMPLE SUBSTITUTION CIPHERSCryptologia, 1993
- Tabu Search: A TutorialInterfaces, 1990
- Optimization by Simulated AnnealingScience, 1983
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953