Bifid Cipher

[Back] This page defines a Bifid Cipher [Theory]:

  1 2 3 4 5
1 B G W K Z
2 Q P N D S
3 I O A X E
4 F C L U M
5 T H Y V R

First we look up the grid, and the arrange the two character value into two rows. For example is we have plaintext of "maryland", then "m" is "4" and "5", so we place "4" in the first row, and "5" in the second row, and continue to do this for all the letters:

maryland
43554322
53533334

Next we read along the rows and merge, to give:

43 55 43 22 53 53 33 34

Next we convert them back to letters from the grid:

L R L P Y Y A X

Plaintext input:

Enter Sentence:

Code:
	Plain: Row1: Row2: Code:

Frequency Analysis of Text

This table shows the occurances of the letters in the text (ignoring the case of the letters):

Mapping to normal

This table shows how the text matches a normal probability to text (where 'E' has the highest level of occurance and 'Z' has the least). The grey rows show what would be expected for the order, and the red one shows what your text gives for the order:

Frequency Analysis

Frequency Analysis of Numbers

This table shows the occurrences of the numbers in the text:

0	1	2	3	4	5	6	7	8	9

Predictions

From this we predict:

From this I predict that of your cipher text maps to in plaintext.
From this I predict that of your cipher text maps to in plaintext.
From this I predict that of your cipher text maps to or in plaintext.
From this I predict that of your cipher text maps to or in plaintext.

Examples

Try "maryland". Try!, which should give: LRLPYYAX
Try "Flee at once". Try!, which should give: uaeol wrins [Ref]