Viewing Single Post From: Brute Forcing The Adfgvx Cipher

Viewing Single Post From: Brute Forcing The Adfgvx Cipher
jdege	Mar 24 2009, 12:27 PM
Elite member Posts: 263 Group: Admin Member #246 Joined: December 7, 2006	I've posted the code for my cryptarithm breaker to this forum. It brute-forces all permutations of the 10 digits. Or the 9, the 11, 12, or occasionally 13 that you occasionally see in the Cm. So it's not like I've no experience in the execution times of exhaustive searches of permutations. My program brute-forces 10-digit cryptarithms in less than 15 seconds. 11-digit in 2-1/2 minutes, 12-digit in half-an-hour. The MA2009 Cm had a 13-digit. That took nearly seven hours. If your program will handle transposition periods of 8 in under a minute, your going to be able to handle periods of 9, 10, and 11, just by waiting longer, but a period of 12 will take more than a week, and a period of 13 will take close to four months. My understanding was that the Germans used 15 or greater. Your method would not have been able to break them, on ordinary computer hardware. For longer transposition periods, some sort of heuristic search of the transposition key space is necessary, since it can be far too large to brute-force. It sounds as if your attempts at hill-climbing didn't work. It seems to me that the next logical step is to figure out why, and to find a heuristic search that does work. As for my own efforts, as I said, my time in this area is allocated until July or August. I may give it a shot, then.
	When cryptography is outlawed, bayl bhgynjf jvyy unir cevinpl.

Brute Forcing The Adfgvx Cipher · General