| Viewing Single Post From: Brute Forcing The Adfgvx Cipher | |
|---|---|
| dabombguyman | May 25 2009, 08:56 PM |
|
Just registered
![]() ![]() ![]()
|
If you think about it, the 3 step ADFGVX (with 3 keys, one for each step) could turn just about any plaintext into almost any cipher text, meaning that it's possible that two different plaintexts (of the same length) could end with the same cipher text, this would make it unbreakable without the keys. Unless someone can prove that you can't turn two different P-texts into the same cipher text. |
| Q3J5cHRvZ3JhcGh5IGlzIGFuIGFydCBmb3Jt | |
![]() |
|
| Brute Forcing The Adfgvx Cipher · General | |




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


8:16 PM Nov 24