![]() ![]() "E ENXJ GBA PW GXWDRR EV GNA UVJZTR IKCEYA, QPGNCF, YK BUGP BUK SIIKO Both the keyword and the plaintext are in English (without spelling-mistakes) The keyword is short, so look out for repeating strings in the cipher-text In general, the shorter the encrypted message, the harder it is to decrypt (because statistical approaches only become powerful for long messages).įor anyone who loves cryptography, this one is actually solvable (it's relatively easy). had tons of encrypted Enigma messages to work with (hundreds every day). Still, breaking Enigma took years of work by some of the world's most talented cryptanalysts at the time! So I don't think I'd stand a chance.Įspecially because Alan Turing et al. Their outstanding work shouldn't be forgotten. It should also be noted that many of the advances of the British in breaking the Enigma were based on knowledge shared with them by Polish cryptanalysts (Marian Rejewski among them) who had began work on Enigma at a much earlier time and had had some breakthroughs. It allowed the British to build an electromechanical device known as "Bombe" (designed by Alan Turing), which ultimately could be used to decipher some (not all) Enigma messages (greatly aiding the allies in the war). There's a slight caveat in what I just said: Obtaining a real Enigma machine from a sinking submarine was indeed a crucial part in the cryptanalysis of Enigma in WW2. It is a (emulated) Enigma machine, but it's (nearly) useless without knowledge of the key (the correct rotor positions). That's why the Website alone doesn't help me at all. And the key itself (without knowing that the message was encrypted by an Enigma machine) is useless as well.īoth the process of encryption and the key must be known simultaneously to decipher a message. The machine itself (without the key) is (pretty much) useless for decrypting messages known to have been encrypted by Enigma. "Neither knowledge of the key nor of the process of encryption shall be sufficient (individually) to break the encryption."Įnigma satisfies this standard to a high degree. ![]() Any good cryptography scheme should satisfy a very important condition: It doesn't really help at all that you posted the Enigma emulator that you used. Unfortunately, I'm no Alan Turing.Īnd you're right, even he would have a hard time breaking your ciphers. I wouldn't be able to type this (on a modern computer/phone) right now, if it hadn't been for him (and others of course). I recommend the movie "The Imitation Game", which gives a beautifully dramatised account of parts of his life. It's cool that you're interested in cryptography and history! :-)Īlan Turing is one of the most underrated geniuses of the 20th century. > If Alan Turing is still alive he would had a hard time solving this :)(I'm good at history) > Here's the link I used for the sentence: > But this sentence, I mixed the rotors making it very hard to decrypt it. One hint for at Thalassokrator and others: Decrypting it doesn't use much time.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |