Caeser

[Back] Enter a message, and a number of shifts, and it will encode for you [Fun test]:

No of shifts:

Examples

Try hello shifted by 3 places. Hello, which should give: KHOOR
Say goodbye shifted by 4 places. Goodbye, which should give: KSSHFCI

Plaintext:	abcdefghijklmnopqrstuvwxyz
Scrambled code:	FGHIJKLMNOPQRSTUVWXYZABCDE

Message:	fred
Encoded:	fred

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

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.