The rail fence cipher (also called a zigzag cipher) is a classical type of transposition cipher. It derives its name from the manner in which encryption is performed, in analogy to a fence built with horizontal rails.
Encryption In the rail fence cipher, the plaintext is written downwards diagonally on successive "rails" of an imaginary fence, then moving up when the bottom rail is reached, down again when the top rail is reached, and so on until the whole plaintext is written out. The ciphertext is then read off in rows. For example, to encrypt the message 'WE ARE DISCOVERED. RUN AT ONCE.' with 3 "rails", write the text as:
W . . . E . . . C . . . R . . . U . . . O . . . . E . R . D . S . O . E . E . R . N . T . N . E . . A . . . I . . . V . . . D . . . A . . . C .
(Spaces and punctuation are omitted.) Then read off the text horizontally to get the ciphertext:
WECRUO ERDSOEERNTNE AIVDAC
Decryption Let N {\displaystyle N} be the number of rails used during encryption. Observe that as the plaintext is written, the sequence of each letter's vertical position on the rails varies up and down in a repeating cycle. In the above example (where N = 3 {\displaystyle N=3} ) the vertical position repeats with a period of 4. In general the sequence repeats with a period of 2 ( N − 1 ) {\displaystyle 2(N-1)} . Let L {\displaystyle L} be the length of the string to be decrypted. Suppose for a moment that L {\displaystyle L} is a multiple of 2 ( N − 1 ) {\displaystyle 2(N-1)} and let K = L 2 ( N − 1 ) {\displaystyle K={L \over {2(N-1)}}} . One begins by splitting the ciphertext into strings such that the length of the first and last string is K {\displaystyle K} and the length of each intermediate string is 2 K {\displaystyle 2K} . For the above example with L = 24 {\displaystyle L=24} , we have K = 6 {\displaystyle K=6} , so we split the ciphertext as follows:
WECRUO ERDSOEERNTNE AIVDAC
Write each string on a separate line with spaces after each letter in the first and last line:
W E C R U O E R D S O E E R N T N E A I V D A C
Then one can read off the plaintext down the first column, diagonally up, down the next column, and so on. If L {\displaystyle L} is not a multiple of 2 ( N − 1 ) {\displaystyle 2(N-1)} , the determination of how to split up the ciphertext is slightly more complicated than as described above, but the basic approach is the same. Alternatively, for simplicity in decrypting, one can pad the plaintext with extra letters to make its length a multiple of 2 ( N − 1 ) {\displaystyle 2(N-1)} . If the ciphertext has not been padded, but you either know or are willing to brute-force the number of rails used, you can decrypt it using the following steps. As above, let L {\displaystyle L} be the length of the string to be decrypted and let N {\displaystyle N} be the number of rails used during encryption. We will add two variables, x {\displaystyle x} and y {\displaystyle y} , where x + 1 {\displaystyle x+1} = the number of diagonals in the decrypted Rail Fence, and y {\displaystyle y} = the number of empty spaces in the last diagonal.
1 = L + y N + ( ( N − 1 ) ∗ x ) {\displaystyle 1={\frac {L+y}{N+((N-1)*x)}}}
Next solve for x {\displaystyle x} and y {\displaystyle y} algebraically, where both values are the smallest number possible. This is easily done by incrementing x {\displaystyle x} by 1 until the denominator is larger than L {\displaystyle L} , and then simply solving for y {\displaystyle y} . Consider the example cipher, modified to use 6 rails instead of 3.
W.........V.........O .E.......O.E.......T.N ..A.....C...R.....A...C ...R...S.....E...N.....E ....E.I.......D.U....... .....D.........R........
The resulting cipher text is:
WVO EOETN ACRAC RSENE EIDU DR
We know that L = 24 {\displaystyle L=24} , and if we use N = 6 {\displaystyle N=6} we can solve the equation above.
… excerpt ends here. Continue reading the full article.
