Beaufort cipher

The Beaufort cipher, created by Sir Francis Beaufort, is a substitution cipher similar to the Vigenère cipher, with a slightly modified enciphering mechanism and tableau.[1] Its most famous application was in a rotor-based cipher machine, the Hagelin M-209.[2] The Beaufort cipher is based on the Beaufort square which is essentially the same as a Vigenère square but in reverse order starting with the letter "Z" in the first row,[3] where the first row and the last column serve the same purpose.[4]

Using the cipher

To encrypt, first choose the plaintext character from the top row of the tableau; call this column P. Secondly, travel down column P to the corresponding key letter K. Finally, move directly left from the key letter to the left edge of the tableau, the ciphertext encryption of plaintext P with key K will be there.

For example if encrypting plain text character "d" with key "m" the steps would be:

find the column with "d" on the top,
travel down that column to find key "m",
travel to the left edge of the tableau to find the ciphertext letter ("J" in this case).

To decrypt, the process is reversed. The Beaufort cipher is a reciprocal cipher, that is, decryption and encryption algorithms are the same.

Algebraic description

The Beaufort cipher can be described algebraically. For example, using an encoding of the letters A–Z as the numbers 0–25 and using addition modulo 26, let $M=M_{1}\dots M_{n}$ be the characters of the message, $C=C_{1}\dots C_{n}$ be the characters of the cipher text and $K=K_{1}\dots K_{n}$ be the characters of the key, repeated if necessary. Then Beaufort encryption $E$ can be written,

C_{i}=E_{K}(M_{i})=(K_{i}-M_{i})\mod {26}

.

Similarly, decryption $D$ using the key $K$ ,

M_{i}=D_{K}(C_{i})=(K_{i}-C_{i})\mod {26}

.

Decrypting as a Vigenere cipher

Due to the similarities between the Beaufort cipher and the Vigenère cipher it is possible, after applying a transformation, to solve it as a Vigenère cipher. By replacing every letter in the ciphertext and keytext with its opposite letter (such that 'a' becomes 'z', 'b' becomes 'y' etc.) it can be solved like a Vigenère cipher.

Distinguished from 'variant Beaufort'

The Beaufort cipher should not be confused with the "variant Beaufort" cipher. In variant Beaufort, encryption is performed by performing the decryption step of the standard Vigenère cipher, and likewise decryption is performed by using Vigenère encryption.

gollark: Wait, no, that's -1/12 so it's fine.

gollark: As all engineers know, sin x = x. So the problem simplifies to the sum of nx/n = x with n from 1 to infinity, which doesn't converge, so you're wrong.

gollark: It even has live chat.

gollark: osmarks internet radio™ propaganda best.

gollark: Well, concrete and glass.

References

Franksen, Ole Immanuel, Babbage and cryptography. Or, the mystery of Admiral Beaufort's cipher. Mathematics and Computers in Simulation 35 (1993) 327-367
Mollin, Richard A., An Introduction to Cryptography, page 100. Chapman & Hall/CRC, 2001
Jörg Rothe (2006). Complexity Theory and Cryptology: An Introduction to Cryptocomplexity. Springer Science & Business Media. p. 164. ISBN 9783540285205.
Arto Salomaa (2013). Public-Key Cryptography: Volume 23 of Monographs in Theoretical Computer Science. An EATCS Series. Springer Science & Business Media. p. 31. ISBN 9783662026274.

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

[1] Franksen, Ole Immanuel, Babbage and cryptography. Or, the mystery of Admiral Beaufort's cipher. Mathematics and Computers in Simulation 35 (1993) 327-367

[2] Mollin, Richard A., An Introduction to Cryptography, page 100. Chapman & Hall/CRC, 2001

[3] Jörg Rothe (2006). Complexity Theory and Cryptology: An Introduction to Cryptocomplexity. Springer Science & Business Media. p. 164. ISBN 9783540285205.

[4] Arto Salomaa (2013). Public-Key Cryptography: Volume 23 of Monographs in Theoretical Computer Science. An EATCS Series. Springer Science & Business Media. p. 31. ISBN 9783662026274.