| Viewing Single Post From: Brute Forcing The Adfgvx Cipher | |
|---|---|
| osric | Mar 20 2009, 08:22 PM |
|
Advanced Member
![]() ![]() ![]() ![]() ![]()
|
Yes this is my insight, but I would be surprised if some of my ACA colleagues haven't had the same thought! I use this technique for other Transpositions when the occasion demands. An example is solving the Myszkowski cipher, which I find is best done with a genetic algorithm. An initial requirement is to find the period, and trying all reasonable periods with a limited Hillclimb works well. Equally it is useful for really difficult Columnar transpositions, of 20 columns or more but with the actual number unknown. Also the Amsco cipher of unknown period. I've improved the effectiveness of my ADFGVX transposition algorithm today and so far am getting a solution every run. But as we know 'one swallow doesn’t make a Summer' when dealing with stochastic algorithms. |
![]() |
|
| Brute Forcing The Adfgvx Cipher · General | |




![]](http://209.85.122.85/static/1/pip_r.png)


8:26 PM Nov 25