Hebern rotor machine
From Wikipedia, the free encyclopedia
The Hebern Rotor Machine was an electro-mechanical encryption machine built by combining the mechanical parts of a standard typewriter with the electrical parts of an electric typewriter, connecting the two through a scrambler. It is the first example (though just barely) of a class of machines known as rotor machines that would became the primary form of encryption during World War II and for some time after, and which included such famous examples as the German Enigma.
[edit] History
Edward Hugh Hebern was a building contractor who was jailed in 1908 for stealing a horse. It is claimed that, with time on his hands, he started thinking about the problem of encryption, and eventually devised a means of mechanizing the process with a typewriter. At the time he had no funds to be able to spend time working on such a device, but he dusted off his thinking in 1917, built a sample, and patented it in 1918. Agnes Driscoll, the chief civilian employee of the US Navy's cryptography operation (later to become OP-20-G) between WWI and WWII, spent some time working with Hebern before returning to Washington and OP-20-G in the mid-'20s.
Hebern was so convinced of the future success of the system that he formed the Hebern Electric Code company with money from several investors. Over the next few years he repeatedly tried to sell the machines both to the US Navy and Army, as well as to commercial interests such as banks. None was terribly interested, as at the time cryptography was not widely considered important outside governments. It was probably because of William F. Friedman's confidential analysis of the Hebern machine's weaknesses (substantial, though repairable) that its sales to the US government were so limited; Hebern was never told of them. Perhaps the best indication of a general distaste for such matters was the statement by Henry Stimson in his memoirs that "gentlemen should not read each other's mail". It was Stimson, as Secretary of State under Hoover, who withdrew State Department support for Herbert Yardley's American Black Chamber, leading to its closing.
Eventually his investors ran out of patience, and sued Hebern for stock manipulation. He spent another brief period in jail, but never gave up on the idea of his machine. In 1931 the Navy finally purchased several systems, but this was to be his only real sale.
There were three other patents for rotor machines issued in 1919, and several other rotor machines were designed independently at about the same time. The most successful and widely used was the Enigma machine.
[edit] Description
The key to the Hebern design was a disk with electrical contacts on either side, known today as a rotor. Linking the contacts on either side of the rotor were wires, with each letter on one side being wired to another on the far side in a random fashion. The wiring encoded a single substitution alphabet.
When the user pressed a key on the typewriter keyboard, a small amount of current from a battery flowed through the key into one of the contacts on the input side of the disk, through the wiring, and back out a different contact. The power then operated the mechanicals of an electric typewriter to type the encrypted letter, or alternately simply lit a bulb or paper tape punch from a teletype machine.
Normally such a system would be no better than the single-alphabet systems of the 1500s. However the rotor in the Hebern machine was geared to the keyboard on the typewriter, so that after every keypress, the rotor turned and the substitution alphabet thus changed slightly. This turns the basic substitution into a polyalphabetic one similar to the well known Vigenère cipher, with the exception that it required no manual lookup of the keys or cyphertext. Operators simply turned the rotor to a pre-chosen starting position and started typing. To decrypt the message, they turned the rotor around in its socket so it was "backwards", thus reversing all the substitutions. They then typed in the ciphertext and out came the plaintext.
Better yet, several rotors can be placed such that the output of the first is connected to the input of the next. In this case the first rotor operates as before, turning once with each keypress. Additional rotors are then spun with a cam on the one beside it, each one being turned one position after the one beside it rotates a full turn. In this way the number of such alphabets increases dramatically. For a rotor with 26 letters in its alphabet, five such rotors "stacked" in this fashion allows for 265 = 11,881,376 different possible substitutions.
William F. Friedman attacked the Hebern machine soon after it came on the market in the 1920s. He quickly "solved" any machine that was built similar to the Hebern, in which the rotors were stacked with the rotor at one end or the other turning with each keypress, the so-called fast rotor. In these cases the resulting ciphertext consisted of a series of single-substitution cyphers, each one 26 letters long. He showed that fairly standard techniques could be used against such systems, given enough effort.
Of course, this fact was itself a great secret. This may explain why the Army and Navy were unwilling to use Hebern's design, much to his surprise.
[edit] External links
|
Cipher machines
|
|---|
| Rotor machines: CCM | Enigma | Fialka | Hebern | HX-63 | KL-7 | Lacida | M-325 | Mercury | NEMA | OMI | Portex | SIGABA | SIGCUM | Singlet | Typex |
| Mechanical: Bazeries cylinder | C-36 | C-52 | CD-57 | Cipher disk | HC-9 | Kryha | Jefferson disk | M-94 | M-209 | Reihenschieber | Scytale |
| Teleprinter: 5-UCO | BID 770 | KW-26 | KW-37 | Lorenz SZ 40/42 | Siemens and Halske T52 |
| Secure voice: KY-3 | KY-57 | KY-58 | KY-68 | OMNI | SIGSALY | STE | STU-II | STU-III | VINSON | SCIP | Sectéra Secure Module |
| Miscellaneous: Cryptex | JADE | KG-84 | KL-43 | Noreen | PURPLE | Pinwheel | Rockex |
| History of cryptography | Cryptanalysis | Cryptography portal | Topics in cryptography |
| Symmetric-key algorithm | Block cipher | Stream cipher | Public-key cryptography | Cryptographic hash function | Message authentication code | Random numbers |
