THE AUTOMATED CRYPTANALYSIS OF POLYALPHABETIC CIPHERS

Publisher Website
Google Scholar
Abstract
This paper reports an extension of work published in 1986 by Carroll and Martin [1,2]. The earlier work automatically solved simple substitution ciphers in a cryptotext-only attack. It used a computer program written in the artificial intelligence language Prolog. The Prolog data base contained 1084 rules. The work reported here reduces the running time required to break simple substitution ciphers and breaks polyal-phabetic ciphers as well. Results suggest that the only inherent limitations on the ability to break ciphers as the number of crypto alphabets increases reside in the speed of computation and the availability of cryptotext.

This publication has 0 references indexed in Scilit: