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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
