Not sure if I've missed something about what you're trying to rule out ilzmastr, but the point of a (properly-done) message encrypted with a one-time-pad is that you couldn't rule out the decryption keys, because the pad/key will be long enough that your guesses would produce EVERY possible message ...
After sufficient testing, my results indicate that it is highly unlikely that BoC are reusing a 3 member OTP on the 36 digit code (unlikely and not impossible, since the 36 digit code is not completely known yet). the most legible results of my brute force crack are here: http://pastebin.com ...
After sufficient testing, my results indicate that it is highly unlikely that BoC are reusing a 3 member OTP on the 36 digit code (unlikely and not impossible, since the 36 digit code is not completely known yet). the most legible results of my brute force crack are here: http://pastebin.com ...
I am readying a brute force crack of the BoC code via a One Time Pad approach assuming the pad is re-used across the 6 keys and that the output generates recognizable words (in the Oxford dictionary). I am also checking against a list of BoC exclusive words that are not found in a dictionary like ...
For anyone that wants to play around with one time pads, heres my Python code that subtracts a pad from a key, scroll all the way down: http://www.codeskulptor.org/#user10_f9aS7PxtT4jSw2j.py
print old_decrypt_key('boards',[5,1,9,2,2,5]) will remove the pad "boards" from the code " 5 1 9 2 2 5" and ...
About a dead end when using a One Time Pad decryption approach, feel free to offer suggestions on what pads to use…or suggestions period. http://pastebin.com/b78zU6wD
I plan to implement this into a website, but I did this on my break and I have a lot of work to get back to, so I might not respond ...