This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.Find sources: "Pinwheel" cryptography – news · newspapers · books · scholar · JSTOR (September 2009) (Learn how and when to remove this template message)
The German Lorenz SZ 42 cipher machine contained 12 pinwheels, with a total of 501 pins

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).

Development

The Swedish engineer Boris Caesar Wilhelm Hagelin[1] is credited with having invented the first pinwheel device in 1925.[2] He developed the machine while employed by Emanuel Nobel to oversee the Nobel interests in Aktiebolaget Cryptograph.[2] 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.[3] 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.[4]

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.

See also

References

  1. ^ Beckman, Bengt (2002). Codebreakers: Arne Beurling and the Swedish Crypto Program During World War II. American Mathematical Soc. ISBN 978-0-8218-2889-2.
  2. ^ a b Holden, Joshua (2019). The Mathematics of Secrets: Cryptography from Caesar Ciphers to Digital Encryption. Princeton & Oxford: Princeton University Press. p. 74. ISBN 9780691183312.
  3. ^ Leeuw, Karl Maria Michael de; Bergstra, Jan (2007). The History of Information Security: A Comprehensive Handbook. Amsterdam: Elsevier. pp. 483. ISBN 9780444516084.
  4. ^ Lasry, George (2018). A Methodology for the Cryptanalysis of Classical Ciphers with Search Metaheuristics. Kassel, Germany: Kassel University Press GmbH. p. 38. ISBN 9783737604581.


Categories