Viewing Single Post From: Brute Forcing The Adfgvx Cipher

Viewing Single Post From: Brute Forcing The Adfgvx Cipher
osric	Mar 17 2009, 04:29 PM
Advanced Member Posts: 51 Group: Members Member #3,254 Joined: March 15, 2009	I chanced on this discussion thread and decided to try solving ADFGVX with my Churn algorithm, developed from Simulated Annealing specifically to break classical ciphers (Bifid, Playfair, Digrafid and the other such ciphers of the American Cryptogram Association) without using a crib. I decided to start with the simpler ADFGX cipher, using a 5x5 square of 25 letters and a transposition key of 5 columns. A 120-letter plaintext enciphered this way solves in a few seconds without using a crib. I'm now modifying the program to solve ADFGVX using a 6x6 square of 26 letters integers 0 to 9, again with a transposition key 5 columns wide. I am not clear what the best performance achieved by the group is, in terms of message brevity, size of square, width of transposition key, length of crib used (if any) and solving time. Could someone please update me on this? I am of course happy to share any aspect of the Churn approach if it's of interest. Edited by osric, Mar 17 2009, 05:01 PM.


Brute Forcing The Adfgvx Cipher · General