I assume you mean the contest rogster001 held here recently? That was not a one time pad, and therefore could be bruteforced. A true one time pad CANNOT be bruteforced, we have already stated so several times.
I guess you can call it that. Personally I don't think decrypting using a known key is the same as breaking a cipher though.Quote:
getting hold of the key books is a valid way of "breaking the one time pad". meow.
I didn't literally mean you should break it :) The point I was trying to make, and that brewbuck further clarified, is that yes you can bruteforce a list of all possible words but you cannot know which one is the correct one. It is impossible. And saying that the encryption is broken because one of the words in your bruteforced wordlist is the correct one is just plain wrong.Quote:
can we refrain from posting "break this" please and stick to the debate. thank you.
And how would you know only letters from the English alphabet is used? Maybe the plaintext is German? What about punctuation? What if it's not even text?Quote:
if your one time pad uses xor and 0 to 256 you can make a program to ignore anything that is not 'a' to 'z' or 'A' to 'Z' then use a spell checker to throw out nonwords. even though that will reduce the file size intelligence still has to be used to interpret any possible messages. the correct one or not.
I haven't ran brewbuck's code sample, but from quickly looking over it it seems to be able to handle any type of file, both text and binary. How would you find a reliable method of determining if your bruteforced answer is the correct one or not?