![]() ![]() Even pushing the problem to a 4 rotor machine only makes the number of ways EINS can be cyphered to 456,976, which doesn't seem to be an insuperable problem for a modest PC (and is 26^4). Presumably this would require less than 1000 tests, even if one was no cleverer in writing the Fortran code. The catalogue can be sorted so that the test is only required on the subset of the catalogue that begins with the same letter as the first one of the 4-character segment. Enigma never encodes a character as itself, so the first test must be to see if the first character is E, or the second I, etc.Ģ. It seems to me to be a rather trivial job for a current model PC with FTN95 to go through a set of intercepts looking for possible coded EINS sequences 4 characters at a time, especially as:ġ. For a 3 rotor original Enigma there are apparently only 17,576 ways that EINS can be encoded. Apparently, 90% of the messages transmitted include the word EINS. I was particularly taken by the EINS catalogue. I visited Bletchley Park a week ago, and since then I've not been able to tear my thoughts away from Bombes, Collossus, Banburismus and the EINS catalogue.ĭoes anyone know where there are Fortran simulators for any of the Bletchley Park code-breaking algorithms? On the grounds that this part of the Forum really does mean 'anything that meets your fancy', I have a problem. Profile Log in to check your private messages Log in ![]() :: View topic - EnigmaįAQ Search Memberlist Usergroups Register ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |