Admin: Created page with "The '''Beaufort cipher,''' created by Sir Francis Beaufort, is a substitution cipher similar to the Vigenère cipher, with a slightly modified enciphering mechanis..."

2019-03-20T04:28:27Z

Created page with "The '''Beaufort cipher,''' created by Sir Francis Beaufort, is a substitution cipher similar to the Vigenère cipher, with a slightly modified enciphering mechanis..."

New page

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 [[cryptographic tableau|tableau]]. Its most famous application was in a rotor-based cipher machine, the [[M-209|Hagelin M-209]]. 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, where the first row and the last column serve the same purpose.

==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 <tt>A</tt>–<tt>Z</tt> as the numbers 0–25 and using addition [[modular arithmetic|modulo]] 26, let <math>M = M_1 \dots M_n</math> be the characters of the message, <math>C = C_1 \dots C_n</math> be the characters of the cipher text and <math>K = K_1 \dots K_n</math> be the characters of the key, repeated if necessary. Then Beaufort encryption <math>E</math> can be written,

:<math>C_i = E_K(M_i) = (K_i-M_i) \mod {26}</math>.

Similarly, decryption <math>D</math> using the key <math>K</math>,

:<math>M_i = D_K(C_i) = (K_i-C_i) \mod {26}</math>.

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

==Source==

[http://wikipedia.org/ http://wikipedia.org/]

[[Category:Cryptography]]
[[Category:Cryptographic algorithms]]

Beaufort cipher - Revision history

Admin: Created page with "The '''Beaufort cipher,''' created by Sir Francis Beaufort, is a substitution cipher similar to the Vigenère cipher, with a slightly modified enciphering mechanis..."