Title :
Modern optimisation algorithms for cryptanalysis
Author_Institution :
Inf. Security Res. Centre & Distribution Systs. Technol. Centre, Queensland Univ. of Technol., Brisbane, Qld., Australia
fDate :
29 Nov-2 Dec 1994
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 :
codes; cryptography; genetic algorithms; search problems; simulated annealing; NP-complete problem solving; cryptanalysis; cryptology; genetic algorithms; optimisation algorithms; simple substitution; simulated annealing; tabu search; transposition ciphers; Cryptography; Finishing; Genetic algorithms; Government; Humans; Information security; NP-complete problem; Simulated annealing; Statistics;
Conference_Titel :
Intelligent Information Systems,1994. Proceedings of the 1994 Second Australian and New Zealand Conference on
Conference_Location :
Brisbane, Qld.
Print_ISBN :
0-7803-2404-8
DOI :
10.1109/ANZIIS.1994.396969
