Timeline for What's the complexity of the Bombe?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 27, 2021 at 17:45 | comment | added | Josh Hibschman | Despite the posturing above, one way to start to determine (i'm assuming asymptotic) complexity of the Bombe implementation is to look at its simulated source. At a glance, I'll make a guess like a^3 * s, a = |Z|, s=swaps. But we know |Z|=26, and unique perms. So 26*25*24 keys * swaps * 3 rotor orders. github.com/NationalSecurityAgency/enigma-simulator/blob/master/… | |
| Mar 9, 2015 at 21:20 | comment | added | D.W.♦ | In general, we expect you to make a significant effort to understand using standard resources available to you, before asking here. If there is an explanation in Wikipedia, and you haven't read it (only glanced at it), you haven't done enough research & self-study before asking. | |
| Mar 9, 2015 at 19:39 | review | Close votes | |||
| Mar 10, 2015 at 14:17 | |||||
| Mar 9, 2015 at 19:04 | history | edited | Raphael |
edited tags
|
|
| Mar 9, 2015 at 19:04 | comment | added | Raphael | Algorithms don't have complexities, problems have. | |
| Mar 9, 2015 at 19:03 | comment | added | Raphael | This may be better suited to Cryptography. | |
| Mar 9, 2015 at 16:50 | answer | added | D.W.♦ | timeline score: 1 | |
| Mar 9, 2015 at 12:23 | comment | added | Albert Hendriks | Every day there was a message with "Heil Hitler" and "Weather" in it, so they only needed to try combinations that satisfied that. It might be a variation of Constraint Satifsaction Programming (CSP). | |
| Mar 9, 2015 at 10:33 | review | First posts | |||
| Mar 9, 2015 at 11:14 | |||||
| Mar 9, 2015 at 10:28 | history | asked | Yann | CC BY-SA 3.0 |