Code Busters
Code Busters | ||||
Nature Of Science & Lab Event | ||||
Forum Threads | 2019 | 2018 (Trial) | 2016 (Trial) | |
Tests | 2019 | |||
There are no images available for this event | ||||
Question Marathons | 2019 | |||
This event was not held recently in Division B | ||||
Division C Champion | Thomas Jefferson High School for Science and Technology |
Code Busters is an event in Division C for the 2019 season and was held as trial event at both the 2016 National Tournament and the 2018 National Tournament. In this event, up to 3 participants must decode encrypted messages, or they may be required to encode messages with certain advanced ciphers. Competitors are not allowed to bring any resources to this event, but can bring a 4 or 5 function calculator - no scientific or graphing calculators allowed.
Contents
- 1 Test Description
- 1.1 Solving a Caesar Shift cipher
- 1.2 Mono-alphabetic Substitution
- 1.3 Xenocrypt
- 1.4 Affine Cipher and Modular Arithmetic
- 1.5 Atbash Cipher
- 1.6 Hill Cipher
- 1.7 Vigenère Cipher
- 1.8 Running Key Cipher
- 1.9 Baconian Cipher
- 1.10 RSA Cipher
- 1.11 Sir Arthur Conan Doyle's Cipher from The Adventure of the Dancing Men
- 2 Test Format
- 3 External Links
- 4 2016 National Tournament Trial Events
Test Description
The very first cryptogram is timed - when solved, a team member should raise their hand/shout "bingo!"/etc to alert the supervisor. The first question will be an Aristocrat with or without a hint. Teams will receive bonus points depending on their time, but they may make as many attempts as they want to break the code without any penalties. The first cryptogram may also be used as a tiebreaker. The timing bonus will be calculated from the start of the event until the question is answered successfully, or until 10 minutes have elapsed. Teams may still answer the question after 10 minutes; however, the timing bonus is 0. The time bonus for the first question is 4*(600-number of seconds taken). Solutions are given full points only if the solution is an exact match or differs by only one or two letters. Each additional error after the first 2 will result in a deduction of 100 points. These deductions will not exceed the value of question (can not go below 0). Questions with answers as numbers, the answer is either correct or incorrect (no partial points).
Solving a Caesar Shift cipher
One example of a mono-alphabetic substitution is Caesar shift cipher, where each letter is replaced by one shifted by a certain amount. For example, the following table has each letter shifted three positions to the right.
Original Alphabet | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Shifted Alphabet (to the right 3) | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | A | B | C |
From this table, it is clear that each shifted letter is the same as the original letter three spaces from it (A becomes D, B becomes E, etc). Thus, a message like "Science Olympiad is cool" would become "Vflhqfh Robpsldg lv frro" using a Caesar shift of 3. The alphabet can be shifted any number of times. This type of cryptogram can be solved through brute force, by taking a section of the message and writing out all 26 possible shifts below it, upon which the message is easily revealed. For example, try to decode "xhntqd". First, write out the ciphertext. Then, write out the possible shifts below it.
Decryption Shift | Possible Plaintext |
---|---|
0 | xhntqd |
1 | wgmspc |
2 | vflrob |
3 | uekqna |
4 | tdjpmz |
5 | scioly |
After shifting "xhntqd" five times, the plaintext is revealed to be "scioly", and no further shifts need to be tested.
Mono-alphabetic Substitution
A mono-alphabetic substitution is one where the same plaintext letters are replaced by the same ciphertext letters. Since specific encryption/decryption methods are not mentioned in the rules, a variety of ways will be covered in the following section. Mono-alphabetic ciphers may contain spaces (Aristocrats) or may have spaces removed (Patristocrats). Mono-alphabetic ciphers may use K1, K2, or random alphabets as defined by the ACA.
Solving a mono-alphabetic substitution cipher using patterns
This may be the most common way to solve a cipher on a Code Busters test, because the supervisor may not write that a Caesar cipher etc. was used to encrypt.
First, find the corresponding letter for a few cipher letter by:
- Look for words that are only one letter long. These will almost always be A or I, unless the cryptogram is a poem, in which case O may be used. I usually appears at the start of the sentence, while A is usually more common.
- Look for repeated blocks of three. The block is often THE: THE is the most common english word, used almost twice as often as the second most common, BE.
- Look for frequency of letters. The 12 most frequent letters in the English alphabet are ETAOIN SHRDLU, with E being the most common by a significant margin.
- Look for contractions. If an apostrophe is seen in the ciphertext, it can be an easy way to start deciphering using the table below.
- Look for double letters. They're often LL, followed in frequency by EE, SS, OO and TT.
Two clues may give different substitution, in which case experimenting may be helpful.
Then, substitute the known letters, and gradually decode more words using the word fragments. Starting with two or three-letter words are often easier, because of the limited possibilities.
Endings | Examples |
---|---|
'T | Won't, Don't, Isn't, Aren't, Weren't, Shouldn't, Couldn't, Didn't, Can't |
'S | He's, She's, It's, Who's, There's, That's |
'D | I'd, He'd, She'd, We'd, They'd, You'd |
'M | I'm |
'RE | You're, They're, We're |
'VE | They've, You've, We've |
'LL | I'll, He'll, She'll, We'll, They'll, It'll, Who'll |
Messages with Spaces and a Hint
These cryptograms are similar to those published in 20th century newspapers. These are usually solved using patterns, as described above, with the hint providing additional information to assist the decryption.
Messages with Spaces
These cryptograms are similar to NSA and diplomatic messages, and do not have a hint. These are usually solved using patterns, as described above.
Messages with Spaces and Spelling Errors
These cryptograms are similar to FBI and organized crime messages. These are often solved by patterns, with additional care:
- The letter frequencies likely do not change, and can be applied.
- THE and many of the most common words are seldom misspelled, unless intentionally. OF may be unintentionally misspelled as UV.
- Piecing together words with word fragments may be more difficult. Misspelled words often sound the same as the actual word, which can be used to check the decrypted message.
Messages without Spaces
These cryptograms are similar to NSA and espionage messages, and have a hint. An example is: "UVYNYGUSZYSBZBULAPIAZUACAZZAMLGFALPERAJZNYGUUAFBR". Students are told that the last word is TODAY, and the cipher begins with a three-letter word, followed by a four-letter word.
- Begin by writing in TODAY. UVYNYGUSZYSBZBULAPIAZUACAZZAMLGFALPERAJZNYGUTODAY. From this, we can see that U represents T, A represents O, F represents D, B represents A, and R represents Y.
- Replace the cipher text with the decrypted letters. TVYNYGTSZYSBZATLOPIOZTOCOZZOMLGDOLPEYOJZNYGTTODAY
- The first word is a 3 letter word beginning with T, which we can guess decrypts to THE. Replace Vs with H and Y with E. THENEGTSZESAZATLOPIOZTOCOZZOMLGDOLPEYOJZNEGTTODAY
- In this cipher, we can see the phrase "TOCOZZOM". Because of the double Z in the middle, it can be inferred that this decrypts to TOMORROW. Replace Z with R, C with M, and M with W. THENEGTSRESARATLOPIORTOMORROWLGDOLPEYOJRNEGTTODAY.
- We can see the letters YOJR. This is probably YOUR. Replace J with U. THENEGTSRESARATLOPIORTOMORROWLGDOLPEYOURNEGTTODAY.
- The letters LG after the noun TOMORROW likely decrypt to IS. Replace L with I and G with S. THENESTSRESARATIOPIORTOMORROWISDOIPEYOURNESTTODAY.
- NEST probably decrypts to B, as that is the only word that makes sense in this context. THEBESTSRESARATIOPIORTOMORROWISDOIPEYOURBESTTODAY.
- At this point, the cipher is able to be solved using common sense. SRESARATIOP likely means PREPARATION. IOR probably means FOR. DOIPE probably means DOING. Thus, the message is THE BEST PREPARATION FOR TOMORROW IS DOING YOUR BEST TODAY.
Messages without Spaces or Hints
These cryptograms are extremely difficult and may not be tested very frequently. In the event that a test does contain one, the best method is using the patterns listed above, especially finding repeated three letter "phrases" or double letters.
Xenocrypt
At the invitational/Regional level, one cryptogram may be in Spanish as a challenge. At the state level, there will be at least one. It may be helpful if one of the partners is fluent in or has a few years of knowledge in Spanish.
For Spanish cryptograms, n and ñ are treated as different letters. However, letters with accents are treated the same as without (a and á are the same). This means that, when working with cryptograms, accent marks do not factor in. Also, ch, ll, and rr are NOT considered distinct letters. Thus, "churro" would have 6 letters: c-h-u-r-r-o. The Spanish alphabet used for cryptograms is as follows:
A | B | C | D | E | F | G | H | I | J | K | L | M | N | Ñ | O | P | Q | R | S | T | U | V | W | X | Y | Z |
The frequency table of Spanish letters is as follows, from most to least frequent:
Letter | E | A | O | S | N | R | I | L | D | T | U | C | M | P |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Frequency | 14.08% | 12.16% | 9.20% | 7.20% | 6.83% | 6.41% | 5.98% | 5.24% | 4.67% | 4.60% | 4.69% | 3.87% | 3.08% | 2.89% |
Letter | B | H | Q | Y | V | G | F | J | Z | Ñ | X | K | W | |
Frequency | 1.49% | 1.18% | 1.11% | 1.09% | 1.05% | 1.00% | 0.69% | 0.52% | 0.47% | 0.17% | 0.14% | 0.11% | 0.04% |
Spanish cryptograms are often solved with patterns as well, with a few differences:
- Look for the two most common letters, instead of the most common letters: E and A have relatively close frequency, and are much higher than the rest.
- The most common spanish words are DE, LA, QUE, EL, EN. Since Spanish has far more two-letter words, it is helpful to decrypt them, using the placement of the letter E. QUE is the most common three-letter word, almost twice as common as the next ones.
- Decrypting words using word fragments are much more difficult for teams without fluency in Spanish.
Affine Cipher and Modular Arithmetic
The Affine cipher uses an alphabet of size [math]m[/math] with keys [math]a[/math] and [math]b[/math] such that [math]a,b[/math] are integers, and [math]a[/math] and [math]m[/math] are coprime (there is no positive divisor for both of them besides 1). Assuming the alphabet is of size 26, [math]a[/math] can be 1, 3, 5, 7, 9, 11 ,15, 17, 19, 21, 23 and 25. Each letter in the alphabet corresponds to a number from [math]0[/math] to [math]m-1[/math]. The most common correspondence for the English alphabet is shown below.
Letter | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Number | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 |
The encryption formula for an Affine cipher is:
[math]E(x)=(ax+b)\bmod m.[/math]
In the formula, [math]x[/math] is the corresponding number of plaintext. For example, if encrypting N, [math]x[/math] would be 13. Essentially, numbers are plugged into the formula and the resulting number corresponds to the encrypted letter.
For this example, we encode the message CODEBUSTERS using [math]a=9[/math] and [math]b=42[/math]. To slightly speed up the process, use the fact from modular arithmetic that the function [math]ax+b[/math] does not change if we also take [math]a, b[/math] modulo 26: the function [math]9x+42[/math] is equivalent to the function [math]9x+16[/math] or [math]9x-10[/math].
Plaintext | C | O | D | E | B | U | S | T | E | R | S |
---|---|---|---|---|---|---|---|---|---|---|---|
[math]x[/math] | 2 | 14 | 3 | 4 | 1 | 20 | 18 | 19 | 4 | 17 | 18 |
[math]9x+42[/math] | 60 | 168 | 69 | 78 | 51 | 222 | 204 | 213 | 78 | 195 | 204 |
[math](9x+42)\bmod 26[/math] | 8 | 12 | 17 | 0 | 25 | 14 | 22 | 5 | 0 | 13 | 22 |
Ciphertext | I | M | R | A | Z | O | W | F | A | N | W |
The encrypted message is IMRAZOWFANW.
To decrypt the message given the key, use the decryption formula:
[math]D(x)=a^{-1}(x-b)\bmod 26[/math]
In this case, [math]a^{-1}[/math] is the multiplicative inverse of [math]a[/math] modulo [math]m[/math] ([math]aa^{-1}\bmod m=1[/math]). Because there are only 26 values, one can brute force it to find the value of [math]t[/math] where [math]ta \bmod m=1[/math]. [math]t[/math] represents [math]a^{-1}[/math].
[math]t[/math] | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
[math]9t \bmod 26[/math] | 9 | 18 | 1 | 10 | 19 | 2 | 11 | 20 | 3 | 12 | 21 | 4 | 13 | 22 | 5 | 12 | 14 | 23 | 6 | 15 | 24 | 7 | 16 | 25 | 8 | 17 |
The table reveals that [math]a^{-1}=3[/math]. Below is a table of [math]a^{-1}[/math] for [math]m=26[/math]:
[math]a[/math] | 1 | 3 | 5 | 7 | 9 | 11 | 15 | 17 | 19 | 21 | 23 | 25 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
[math]a^{-1}[/math] | 1 | 9 | 21 | 15 | 3 | 19 | 7 | 23 | 11 | 5 | 17 | 25 |
Decrypting then becomes a task of plugging into the formula.
Ciphertext | I | M | R | A | Z | O | W | F | A | N | W |
---|---|---|---|---|---|---|---|---|---|---|---|
[math]x[/math] | 8 | 12 | 17 | 0 | 25 | 14 | 22 | 5 | 0 | 13 | 22 |
[math]3(x-42)[/math] | -102 | -90 | -75 | -126 | -51 | -84 | -60 | -111 | -126 | -87 | -60 |
[math]3(x-42) \bmod 26[/math] | 2 | 14 | 3 | 4 | 1 | 20 | 18 | 19 | 4 | 17 | 18 |
Plaintext | C | O | D | E | B | U | S | T | E | R | S |
Sometimes, some characters are given, which makes decryption much easier. For example, one might be given the ciphertext "CXWZ ZRC OWGW" and told that the first word is "EDIT". Thus, the characters are mapped as:
Plaintext | Ciphertext |
---|---|
E (4) | C (2) |
D(3) | X (23) |
I (8) | W (22) |
T (19) | Z (25) |
Write out two equations using the first two values and the equation [math]Output=ax+b \bmod 26[/math] in order to solve for [math]b[/math].
[math]a\cdot4+b\bmod 26=2[/math]
[math]a\cdot3+b\bmod 26=23[/math]
Cancel out the [math]a[/math] by multiplying to get the same value (same process as solving a system of equations).
[math]12a+3b\bmod 26=6[/math]
[math]12a+4b\bmod 26=92[/math]
Subtract the equations.
[math]b\bmod 26=86[/math]
Take the mod of the right side.
[math]b\bmod 26=8[/math]
Compute the modulus values to see which works. In this case, 8 works. Now, substitute [math]b[/math] into the equation and repeat the process.
[math]a\cdot3+8\bmod 26=23[/math]
[math]a\cdot3\bmod 26=15[/math]
[math]a=5[/math]
Atbash Cipher
The Atbash Cipher is a variant of the affine cipher (see above) in which both a and b equal 25. This results in the alphabet essentially becoming a mirror (A corresponds to Z, B corresponds to Y, C corresponds to X, etc.). Following the affine cipher, the encryption formula would be:
[math]E(x) = (25x + 25)mod 26[/math]
However, observing the mirror like alphabet yields a much simpler equation of:
[math]E(x) = D(x) = 25 - x[/math]
Since the alphabet is like a mirror, encryption is the same as decryption.
Hill Cipher
NOTE: These cryptograms will be matrix based, and only use 2x2 or 3x3 matrices.
The alphabet for the Hill cipher has corresponding numbers as follows:
Letter | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Number | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 |
Begin by picking a key matrix of either 2x2 or 3x3. These could be a 4 letter word or three 3 letter words. For this example, the key will be WIKI (2x2 matrix). Then, break the message into groups of two. This example will use the message SCIENCE OLYMPIAD, which would be split up into SC IE NC EO LY MP IA DZ. Notice that a Z is added in order to make the last group a group of two. Write the message and the key as matrices.
[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} S \\ C \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 18 \\ 2 \end{pmatrix}=\begin{pmatrix} 412 \\ 196 \end{pmatrix}\bmod 26=\begin{pmatrix} 22 \\ 14 \end{pmatrix}=\begin{pmatrix} W \\ O \end{pmatrix}[/math]
In the second step of the above equation, the matrices are multiplied. Although it may seem complicated, matrix multiplication is fairly straightforward.
[math]\begin{pmatrix} A & B \\ C & D \end{pmatrix}*\begin{pmatrix} E \\ F \end{pmatrix}[/math]
The matrices are multiplied as follows: [math]A[/math] and [math]E[/math] are multiplied, then added to the product of [math]B[/math] and [math]F[/math]. [math]C[/math] and [math]E[/math] are multiplied and added to the product of [math]D[/math] and [math]F[/math]. Thus, the product of the matrices is:
[math]\begin{pmatrix} AE + BF \\ CE + DF \end{pmatrix}[/math]
Matrix multiplication for 3x3 matrices is very similar.
[math]\begin{pmatrix} A & B & C \\ D & E & F \\ G & H & I \\ \end{pmatrix}*\begin{pmatrix} J & K & L \\ M & N & O \\ P & Q & R \\ \end{pmatrix}[/math]
Just like in a 2x2 matrix, the row of the first matrix is multiplied by the column of the second matrix, giving the following product.
[math]\begin{pmatrix} AJ+BM+CP & AK+BN+CQ & AL+BO+CR \\ DJ+EM+FP & DK+EN+FQ & DL+EO+FR \\ GJ+HM+IP & GK+HN+IQ & GL+HO+IR \\ \end{pmatrix}[/math]
It is important to note that in order to multiply matrices, the number of columns in the first matrix MUST equal the number of rows in the second matrix. The size of the product matrix is the number of rows in the first matrix x the number of columns in the second matrix.
The "mod" operation is also fairly straightforward. Essentially, it finds the remainder after dividing. For example, [math]153 \bmod 26 [/math] is equal to the remainder of [math]153 / 26[/math], which is 23. On a scientific calculator, this is found by dividing the two numbers, subtracting the integer value from the answer, and multiplying the decimals by the number after "mod" (in this case, 26). Therefore, the process would be:
[math]153/26=5.884615385[/math]
[math]5.884615385-5=0.884615385[/math]
[math]0.884615385*26=23[/math]
The rest of the encoding of the message is shown below.
[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} S \\ C \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 18 \\ 2 \end{pmatrix}=\begin{pmatrix} 412 \\ 196 \end{pmatrix}\bmod 26=\begin{pmatrix} 22 \\ 14 \end{pmatrix}=\begin{pmatrix} W \\ O \end{pmatrix}[/math]
[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} I \\ E \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 8 \\ 4 \end{pmatrix}=\begin{pmatrix} 208 \\ 112 \end{pmatrix}\bmod 26=\begin{pmatrix} 0 \\ 8 \end{pmatrix}=\begin{pmatrix} A \\ I \end{pmatrix}[/math]
[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} N \\ C \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 13 \\ 2 \end{pmatrix}=\begin{pmatrix} 302 \\ 146 \end{pmatrix}\bmod 26=\begin{pmatrix} 16 \\ 16 \end{pmatrix}=\begin{pmatrix} Q \\ Q \end{pmatrix}[/math]
[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} E \\ O \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 4 \\ 14 \end{pmatrix}=\begin{pmatrix} 200 \\ 152 \end{pmatrix}\bmod 26=\begin{pmatrix} 18 \\ 22 \end{pmatrix}=\begin{pmatrix} S \\ W \end{pmatrix}[/math]
[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} L \\ Y \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 11 \\ 24 \end{pmatrix}=\begin{pmatrix} 434 \\ 302 \end{pmatrix}\bmod 26=\begin{pmatrix} 18 \\ 16 \end{pmatrix}=\begin{pmatrix} S \\ Q \end{pmatrix}[/math]
[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} M \\ P \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 12 \\ 15 \end{pmatrix}=\begin{pmatrix} 384 \\ 240 \end{pmatrix}\bmod 26=\begin{pmatrix} 20 \\ 6 \end{pmatrix}=\begin{pmatrix} U \\ G \end{pmatrix}[/math]
[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} I \\ A \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 8 \\ 0 \end{pmatrix}=\begin{pmatrix} 176 \\ 80 \end{pmatrix}\bmod 26=\begin{pmatrix} 20 \\ 2 \end{pmatrix}=\begin{pmatrix} U \\ C \end{pmatrix}[/math]
[math] \begin{pmatrix} W & I \\ K & I \end{pmatrix}*\begin{pmatrix} D \\ Z \end{pmatrix}=\begin{pmatrix} 22 & 8 \\ 10 & 8 \end{pmatrix}*\begin{pmatrix} 3 \\ 25 \end{pmatrix}=\begin{pmatrix} 226 \\ 230 \end{pmatrix}\bmod 26=\begin{pmatrix} 18 \\ 22 \end{pmatrix}=\begin{pmatrix} S \\ W \end{pmatrix}[/math]
The encoded message is WOAIQQSWSQUGUCSW.
3x3 matrix encryption works in the same way. This example will encrypt "EDIT THE WIKI" using the key "BEE FLY BUG". First, split up the plaintext into groups of three, which becomes EDI TTH EWI KIZ. Once again, the last group has a Z added to make it a group of three.
[math] \begin{pmatrix} B & E & E \\ F & L & Y \\ B & U & G \end{pmatrix}*\begin{pmatrix} E \\ D \\ I \\ \end{pmatrix}=\begin{pmatrix} 1 & 4 & 4 \\ 5 & 11 & 24 \\ 1 & 20 & 6 \end{pmatrix}*\begin{pmatrix} 4 \\ 3 \\ 8 \end{pmatrix}=\begin{pmatrix} 48 \\ 245 \\ 112 \end{pmatrix}\bmod 26=\begin{pmatrix} 22 \\ 11 \\ 8 \end{pmatrix}=\begin{pmatrix} W \\ L \\ I \end{pmatrix}[/math]
[math] \begin{pmatrix} B & E & E \\ F & L & Y \\ B & U & G \end{pmatrix}*\begin{pmatrix} T \\ T \\ H \\ \end{pmatrix}=\begin{pmatrix} 1 & 4 & 4 \\ 5 & 11 & 24 \\ 1 & 20 & 6 \end{pmatrix}*\begin{pmatrix} 19 \\ 19 \\ 7 \end{pmatrix}=\begin{pmatrix} 123 \\ 472 \\ 441 \end{pmatrix}\bmod 26=\begin{pmatrix} 19 \\ 4 \\ 25 \end{pmatrix}=\begin{pmatrix} T \\ E \\ Z \end{pmatrix}[/math]
[math] \begin{pmatrix} B & E & E \\ F & L & Y \\ B & U & G \end{pmatrix}*\begin{pmatrix} E \\ W \\ I \\ \end{pmatrix}=\begin{pmatrix} 1 & 4 & 4 \\ 5 & 11 & 24 \\ 1 & 20 & 6 \end{pmatrix}*\begin{pmatrix} 4 \\ 22 \\ 8 \end{pmatrix}=\begin{pmatrix} 124 \\ 454 \\ 492 \end{pmatrix}\bmod 26=\begin{pmatrix} 20 \\ 12 \\ 24 \end{pmatrix}=\begin{pmatrix} U \\ M \\ Y \end{pmatrix}[/math]
[math] \begin{pmatrix} B & E & E \\ F & L & Y \\ B & U & G \end{pmatrix}*\begin{pmatrix} K \\ I \\ Z \\ \end{pmatrix}=\begin{pmatrix} 1 & 4 & 4 \\ 5 & 11 & 24 \\ 1 & 20 & 6 \end{pmatrix}*\begin{pmatrix} 10 \\ 8 \\ 25 \end{pmatrix}=\begin{pmatrix} 142 \\ 738 \\ 320 \end{pmatrix}\bmod 26=\begin{pmatrix} 12 \\ 10 \\ 8 \end{pmatrix}=\begin{pmatrix} M \\ K \\ I \end{pmatrix}[/math]
The encoded message is WLITEZUMYMKI.
When given 4 corresponding plaintext and ciphertext create two sets of equations and solve them. For example if ABCD plaintext corresponds to DCBA and you have to find the encryption key [math]\begin{pmatrix} A & B \\ C & D \\ \end{pmatrix}[/math] create 2 matrices with AB and CD [math]\begin{pmatrix} 0\\ 1\\ \end{pmatrix}[/math] [math]\begin{pmatrix} 2\\ 3\\ \end{pmatrix}[/math] You get 0A plus 1B = 3 and 0C plus 1D = 2 2A plus 3B = 1 and 2C plus 3D = 0 With 0A plus 1B = 3 times 3 is 0A plus 3B = 9 2A plus 3B = 3 minus (0A plus 3B = 9 2A = -6 mod 26 or 2A=20 A value = 10 Repeat for other values
Vigenère Cipher
The Vigenère cipher, invented by Blaise de Vigenère in the 16th century, is a polyalphabetic cipher. This means that each letter is shifted by a different amount. According to the rules, students will probably be asked to encrypt rather than decrypt Vigenère ciphers. Encrypting is a fairly straightforward procedure.
First, write out the message with the key under it, repeating the key as many times as necessary. An example is shown.
Message | S | C | I | E | N | C | E | O | L | Y | M | P | I | A | D | I | S | C | O | O | L |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Key | S | C | I | O | L | Y | S | C | I | O | L | Y | S | C | I | O | L | Y | S | C | I |
Then, take out the alphabet square, as shown below. This will typically be provided on the test.
Using the alphabet square, encode the plaintext. The first message letter is S and the first key letter is S, therefore, look at the table to see where row S and column S intersect. It is clear that they intersect at K, so write down K as the first letter of the ciphertext. Repeat this with the rest of the message. Thus, the encrypted text is "KEQSYAW QTMXNACL WD AGQT"
If the key and ciphertext are both given, decoding is also possible. This is done by taking a letter of the key and finding its row, finding the corresponding letter of ciphertext in that row, and seeing what column that letter falls in. The letter in the column is the letter of the plaintext. In the previous example, the first letter is decoded by going to row S and finding K, which is located in column S. Thus, the plaintext letter is S.
Encoding without table
Tables are typically given on the test, but in the event they are not, the following strategy may be more helpful.
Remember or recreate the correspondence between letter and number like in Affine and Hill Cipher, with A being 0 and Z being 25. Then, for each letter, convert the plain text and key to a sequence of numbers, and add the numbers modulo 26. Then, convert the number back to letter.
For example, if we encode the message "SCIENCEOLYMPIADISCOOL" using the key SCIOLY, we get
To decode a message using this method, subtract instead of add the key's corresponding number: The cipher text K with the corresponding key letter S gives plain text [math]10-18=-8\equiv18\pmod{26}\to \text{S}[/math].
Running Key Cipher
The running key cipher is a variant of the Vigenère Cipher. Rather than using a word as a key, a sentence/paragraph is used as the key. Essentially, instead of repeating a word multiple times as the key, a sentence/paragraph constitutes as the key and is used continuously.
Baconian Cipher
The Baconian cipher replaces each letter of the plaintext with a 5 letter combination of 'A' or 'B'. This replacement is a binary form of encoding, in which 'A' may be considered as 0 and 'B' as 1. One variant of the Baconian Cipher uses a 24 letter alphabet with the letters 'I' and 'J' having the same code, as well as 'U' and 'V'.
Letter | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Code | aaaaa | aaaab | aaaba | aaabb | aabaa | aabab | aabba | aabbb | abaaa | abaaa | abaab | ababa | ababb | abbaa | abbab | abbba | abbbb | baaaa | baaab | baaba | baabb | baabb | babaa | babab | babba | babbb |
Binary | 00000 | 00001 | 00010 | 00011 | 00100 | 00101 | 00110 | 00111 | 01000 | 01000 | 01001 | 01010 | 01011 | 01100 | 01101 | 01110 | 01111 | 10000 | 10001 | 10010 | 10011 | 10011 | 10100 | 10101 | 10110 | 10111 |
Another variant of this cipher uses a unique code for each letter (26 letter alphabet).
Letter | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Code | aaaaa | aaaab | aaaba | aaabb | aabaa | aabab | aabba | aabbb | abaaa | abaab | ababa | ababb | abbaa | abbab | abbba | abbbb | baaaa | baaab | baaba | baabb | babaa | babab | babba | babbb | bbaaa | bbaab |
Binary | 00000 | 00001 | 00010 | 00011 | 00100 | 00101 | 00110 | 00111 | 01000 | 01001 | 01010 | 01011 | 01100 | 01101 | 01110 | 01111 | 10000 | 10001 | 10010 | 10011 | 10100 | 10101 | 10110 | 10111 | 10110 | 10111 |
Standard numbering systems use a base 10 method of counting (ones place, tens place, hundreds place, etc). What this means is that normally for example 24 = 2*10 + 4. The Baconian Cipher uses a base 2 system. The following is an example of base 2 converted to standard base 10: 01001 (base 2) = (0*16 + 1*8 + 0*4 + 0*2 + 1*1) = (1*8 + 1*1) = 9 (base 10). As seen in the chart above, 01001 corresponds to J, which is the 9th letter in the alphabet (assuming A = 0). When the first variant is shown, the numbering system will be off by 1 from J to U and off by 2 from V to Z. For example, 10100 = W, even though 10100 = 20 (base 10) which corresponds to U on the alphabet chart when A = 0.
RSA Cipher
Choose two primes [math]p[/math] and [math]q[/math].
Compute [math]n = pq[/math].
Compute the least common multiple of [math]p-1[/math] and [math]q-1[/math], and call it [math]\lambda(n)[/math].
Choose an integer [math]e[/math] coprime to [math]\lambda(n)[/math].
Compute the inverse [math]d[/math] of [math]e[/math] modulo [math]\lambda(n)[/math].
Now, say that Alice wants to receive from Bob a message. Alice sends Bob her public key (n, e) through a reliable channel. Bob translates his message M to an integer m, and then converts it to ciphertext using [math]c \equiv m^e mod n[/math].
Alice decodes it using [math]m \equiv c^d mod n[/math].
Sir Arthur Conan Doyle's Cipher from The Adventure of the Dancing Men
While not explicitly stated in the rules, the Dancing Men cipher has appeared in previous tests and possibly may appear as a bonus question in future tests. The Dancing Men cipher is a monoalphabetic substitution cipher with spaces where each letter is represented by a dancing man. A man holding a flag indicates the end of a word. In the story, messages encrypted with this cipher were sent to a woman named Elsie, Sherlock Holmes solved the cipher using that E is the most common letter, and that Elsie's name would likely appear. Since the cipher may be easily decrypted if all the dancing men are memorized, there are a few patterns to help remember them. O and A, R and I, and T and E are flipped. T and E are symmetrical about a vertical axis. N and S have the same legs and right arm. The substitution chart is found below.
An example of the Dancing Men cipher is listed below.
contains the message "NOTARIES", which conveniently shows the patterns listed above.
Note: The Dancing Men cipher is not included in 2019 rules. However, it is a common part of tests from past years' trial events.
Test Format
Question Point Distribution
The amount of points each question is worth will be distributed by the following:
- An easy question: 100-150 points
- A medium question: 200-300 points
- A hard question: 350-500 points
- A very hard question: 550-700 points
In the case of a tie, select questions predetermined by the event supervisor will serve as a tiebreaker. The tie is broken using the following criteria in this order: score, degree of correctness, and number attempted.
Code types that may be used at the Invitational and Regional Competitions
- Atbash Cipher
- The Caesar Cipher (shift cipher)
- Mono-alphabetic substitution (can use K1, K2, or random alphabets)
- Aristocrats with a hint - messages with spaces included, and with a hint
- Aristocrats - messages with spaces included, but without a hint
- Aristocrats - messages with spaces and hints, but including spelling/grammar errors
- Aristocrats - messages with spaces and including spelling/grammar errors but no hints
- Patristocrats with a hint - messages with spaces removed, and with a hint
- Patristocrats - messages with spaces removed, but without a hint
- Affine Cipher - encryption only
- Vigenère Cipher - encryption/decryption only, not cryptanalysis
- Baconian cipher and its variants
- Xenorypt (nore more than one)
- Mathematical Cryptanalysis of the Hill Cipher - either producing a decryption matrix given a 2x2
encryption matrix or computing a decryption matrix given 4 plaintext-ciphertext letter pairs.
Code types that may be used at the State and National Competitions
- All Invitational and Regional code types
- The running key cipher
- Cryptanalysis of the Vigenère cipher with a 'crib' (a known plaintext attack)
- The RSA Cipher
- The Hill Cipher - encrypting or decryption with a provided 2x2 or 3x3 matrix.
- Xenocrypt - at least one cryptogram will be in spanish
- Mathematical Cryptanalysis of the Affine Cipher
External Links
- Trial event rules
- Cryptogram Workbook (lots of practice problems, 139 pages)
- Mono-alphabetic Substitution Cipher Practice
- Game-like Cryptogram Practice
- Cipher Tools and Practice Tests
North Carolina SO Practice Tests and Keys
Past tests can also be found here. |
2016 National Tournament Trial Events
Division B: Hovercraft · Geocaching · Potions and Poisons | Division C: Code Busters · Mystery Design · Remote Sensing |