I created this project for my Stanford Cryptography class as an extra credit assignment. The program can determine the secret key of a stream cipher given at least two messages encoded with that key. It depends on XORs of the ciphertexts and the fact that the messages are created from alphanumeric characters and punctuation marks. Because of this, it does not perfectly crack the key with fewer messages; however, with enough ciphertexts, it can determine the key to a high accuracy.
victorchan314 / twotimer Goto Github PK
View Code? Open in Web Editor NEWA two-time-pad cracker that computes XORs between ciphertexts encoded with the same secret keys to crack a stream cipher.