codebusters cheatsheet by_ Ashar and Arnav
codebusters cheatsheet by_ Ashar and Arnav
To encode a message using a Caesar cipher, each letter is shifted a fixed number of positions to the right/left.
To decode a message encoded with a Caesar cipher, each letter is shifted a fixed number of positions to the left/opposite.
The way you encode a message is by shifting the alphabet by a certain number. For example; if the shift is 3, then you take the original alphabet, and
move the letters by 3.
For example, A becomes D because you are shifting by 3 (letters). B becomes E, and so on.
To decode the message, the person just does the opposite and swaps the cipher for plain text.
Plaintext - The normal alphabet
Ciphertext - The alphabet after you’ve shifted it
In situations where you don’t know the key and there is a large number of letters, you can use a graph of the
number of times letters appear in your text and compare it to a graph of the number of times alphabets are used
in the English alphabet. However, this is only for long text.
In situations where there are shorter paragraphs, you have to find the number of times each letter is used in the
text and multiply it by the percentage of times that same letter appears in the English alphabet.
For example, I’d first find a key. Next, If I had a text with 3 A’s in it, I’d multiply it (the number of times it
appears in the text) by the percentage it appears in the English alphabet, which is about 8.5. I’d do that for all
the letters; if “b” came twice, multiply it by a percentage of times it appeared in the alphabet.
Once you are done with that, you add it all up using the computer (it takes a long time doing it by hand), and it
will give you a number in the hundreds. You keep shifting the key because the alphabet percentages change
and you calculate all of them. The key with the highest result is the correct key.
Quick examples:
- Key 1: HELLO-> IFMMP
- Key 5: WORLD -> BTWQI
- Key 13: SECRET -> FRPERG
Porta cipher: for a porta cipher, you will need to take into account the keyword and the ciphertext.
In this example, we will use the word porta as the keyword and YGXRC OYJVR GMQJE YWQGE HWVU as the ciphertext. Arrange the keyword on
top of the ciphertext letter for the letter shown in this picture:
After you do this you have to use the table that is provided in the test
packet. As an example, we will use the first letter of the cipher text; Y.
Since you have to use the letter directly on top of the letter you are
solving, I will also be using the letter P from porta. Find the letter from
the keyword in the leftmost column of the chart, this will be the row the
letter might be in. Now, try to find the letter you are trying to solve from
the ciphertext in the top row. If it is there, where the row the letter from
the keyword is in and the column the letter from the ciphertext meet will
be the decrypted letter. However, if the letter from the ciphertext is not in
the top row, try to find the letter in the row that the letter from the
keyword is in. When you find this, go to the letter that is on top of it on
the top row. This will be the solved letter of the ciphertext.
Aristocrats: One of the most abundant among the cryptograms. It relies on the knowledge of vocabulary and the frequency of the English letter:
For aristocrats, you need knowledge of letter frequency and knowledge of the relations of words. Here are some tips:
● the only two commonly used one-letter words are I and a, so it's usually a safe bet that any single-letter word in your puzzle can be decoded to
one of those two. In very rare cases, a puzzle may use the word O in a poetic or archaic sense
● ETAOIN is simply a mnemonic device combining the six letters that appear most frequently in the English language. The letter 'E' appears
much more frequently than any other letter in the alphabet, with 'T' the most common after that, 'A' the third most common, and so on.
● Look for three-letter words with a frequency analysis pattern of HIGH-MEDIUM-HIGH (for 'THE') and HIGH-HIGH-MEDIUM (for 'AND').
This will generally work
better for longer puzzles -
the more letters that appear
in total in a puzzle, the more
likely the statistical
distribution of letters in that
puzzle will approach the
language-wide averages
represented by ETAOIN.