Pinwheel (cryptography)

In cryptography, a pinwheel was a device for producing a short pseudorandom sequence of bits (determined by the machine's initial settings), as a component in a cipher machine. A pinwheel consisted of a rotating wheel with a certain number of positions on its periphery. Each position had a "pin", "cam" or "lug" which could be either "set" or "unset". As the wheel rotated, each of these pins would in turn affect other parts of the machine, producing a series of "on" or "off" pulses which would repeat after one full rotation of the wheel. If the machine contained more than one wheel, usually their periods would be relatively prime to maximize the combined period. Pinwheels might be turned through a purely mechanical action (as in the M-209) or electromechanically (as in the Lorenz SZ 40/42).

The German Lorenz cipher machine contained 12 pinwheels, with a total of 501 pins

Development

The Swedish engineer Boris Caesar Wilhelm Hagelin is credited with having invented the first pinwheel device in 1925.[1] He developed the machine while employed by the Emanuel Nobel to oversaw the Nobel interests in Aktiebolaget Cryptograph.[1] He was the nephew of the founder of the Nobel Prize.The device was later introduced in France and Hagelin was awarded the French order of merit, Legion d'Honneur, for his work.[2] One of the earliest cipher machines that Hagaelin developed was the C-38 and was later improved into the more portable Hagelin m-209. The M-209 is composed of a set of pinwheels and a rotating cage.[3]

Other cipher machines which used pinwheels include the C-52, the CD-57 and the Siemens and Halske T52.

Pinwheels can be viewed as a predecessor to the electronic linear feedback shift register (LFSR), used in later cryptosystems.

gollark: Wow, I've created an amazing amount of errors so far!
gollark: Probably.
gollark: I'll try without the function environment meddlings and see.
gollark: The old version literally ran the entire BIOS to put everything in the environment, starting from just FS functions and a whitelisted set of libraries. The new version is attempting to just change the envs of all the functions round, not that that works at all.
gollark: Indeed.

See also

References
  1. Holden, Joshua (2019). The Mathematics of Secrets: Cryptography from Caesar Ciphers to Digital Encryption. Princeton & Oxford: Princeton University Press. p. 74. ISBN 9780691183312.
  2. Leeuw, Karl Maria Michael de; Bergstra, Jan (2007). The History of Information Security: A Comprehensive Handbook. Amsterdam: Elsevier. pp. 483. ISBN 9780444516084.
  3. Lasry, George (2018). A Methodology for the Cryptanalysis of Classical Ciphers with Search Metaheuristics. Kassel, Germany: Kassel University Press GmbH. p. 38. ISBN 9783737604581.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.