Military enigma cipher machine (Enigma I) ========================================= The 1st Problem --------------- This problem is not difficult but you can not use a simulator available on the Net. You have to make your own. A good advice: read the text accompanying the problem. The 2nd Problem --------------- The cryptogram is long enough to use James J. Gillogly's method. This method requires that there are few plugs used. That was the case in 1936. The 3rd Problem --------------- We know the beginning of the message. It is therefore possible to use the Turing bombe. The 4th Problem --------------- We know all the key except the plugboard setting. The manual method of Yoxall (Yoxallismus) can be used. It is also possible to use the Hill Climbing method. Since the number of tests is small, the programming of the method requires neither a powerful computer, nor a powerfull language, nor an astronomical computing time. The 5th Problem --------------- The use of the Turing bombe requires a Crib. On the other hand, we never know where the middle rotor advancement can take place. We need a lot of menus. On the other hand, if the crib is long enough, two menus are sufficient. The 6th Problem --------------- In 1938, To solve a problem like that, Rejewski used a catalog which provided the signatures of the rotors, but one can use other tools Zygalski's sheets, the bombes (Polish or Turing's one), .... The problem isn't easy because there are very few messages. The 7th Problem --------------- In 1939, the Poles used Zygalski's sheets and their bombses. You have the choice ... The 8th Problem --------------- From May 1940, Zygalski's sheets can no longer be used. Unfortunately, the bombe was not yet available. Fortunately there were the Cillies! IN 2019 you can use Bombe or Hill Climbing but Bombe using and manual methods are more fun. The 9th Problem --------------- We can use a Bombe menu but it is necessary to automate the tests to verify each of the solutions... The 10th Problem --------------- We can use a Bombe menu but it is necessary to automate the tests to verify each of the solutions... It is like the 9th Problem but with a huge numbers of tests to do. The 11th Problem ---------------- We have 20 messages "in-depth". If you find some plaintext, you can build a Bombe menu. The 12th Problem ---------------- We have 25 messages. Many of them are "in-depth". You can use several approaches: cribe deducted from depths, bombe menus deducted from Grundstellung alphabets. The 13th Problem ---------------- This problem is easy with the information given. Don't forget to read the "hint" link. The 14th Problem ---------------- This problem is very hard. This problem tries to mimic the conditions of Rejewski's exploit, which succeeded in reconstructing the wiring of the rotors of the Enigma. The 15th Problem ---------------- This problem is very hard. This problem tries to answer the following question: Could Knox, in 1938, have found Enigma wiring if he had known the QWERTZU? Hint: The Qwertzu is ABCDE ... Z. The 16th Problem ---------------- This problem is easy (but very long) .... if you have the Zygalski's sheets. Otherwise, it is difficult. The 17th Problem ---------------- This problem is very hard. No war time methods can be used. The 18th Problem ---------------- If we know the steckers, we end up with a commercial Enigma! The 23th Problem ---------------- This problem is very hard. This problem tries to mimic the conditions of Rejewski's exploit, which succeeded in reconstructing the wiring of the rotors of the Enigma. In relation to problem 14, the message keys are stereotyped: perhaps we can guess them.