Abstract
This paper examines the output ciphertext sequences produced by an Enigma machine that is keyed repeatedly with the same letter. The number of occurrences of runs (subsequences of successive identical characters) of different lengths is counted, and their statistics are compared with what would be expected for an ideal source of independent, equiprobable random letters from a 25-letter alphabet. Unexpectedly high run counts are found for certain rotor configurations; the “extra” runs are shown to arise from particular features of rotor wiring.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
