Codebusters - K2 Aristocrat
On this page(9 sections)
A K2 Aristocrat is a monoalphabetic substitution: every plaintext letter always turns into the same cipher letter, and the whole mapping comes from one keyword. Spaces and punctuation stay where they are, so word lengths and word shapes survive encryption. That is the main thing a solver exploits. Under the 2027 rules, K2 alphabets are a Division C tool, and they turn up in three places: Aristocrats, Patristocrats and Spanish Xenocrypts. The first question of every exam is a timed Aristocrat, so the method has to be fast and mechanical.
What the rules cover
The 2027 Codebusters rules (Division C, section 3.e and 3.f) list monoalphabetic substitution with K1, K2, K3 or random alphabets, as the American Cryptogram Association defines them, with or without a hint. The Division B list allows only K1 and random alphabets, so a Division B team will not meet a K2 row; the K1 guide is the closest method for B.
| Where a K2 alphabet can appear | Division B (2027) | Division C, Regional (2027) | Division C, State & National (2027) |
|---|---|---|---|
| Aristocrat (spaces kept) | Not listed | Yes | Yes |
| Keyword or key phrase as the answer | Not listed | Yes, for K1, K2 and K3 Aristocrats | Yes |
| Patristocrat (spaces removed, groups of 5) | Not listed (K1 only) | Yes, K1 or K2 | Yes, K1 or K2 |
| Spanish Xenocrypt with an English keyword alphabet | Not listed (K1 only) | Yes, K1 or K2, at most 2 | Yes, K1 or K2, at least 2 and at most 3 |
| Timed first question | Aristocrat, K1 or random | Aristocrat, any C alphabet | Aristocrat, any C alphabet |
A few rules apply to every K2 problem:
- No self-decryption in Aristocrats, Patristocrats or Xenocrypts (3.g): use it to delete guesses.
- Never a special bonus. Special bonus questions are drawn from the other cipher types; in 2027 at least one is a Homophonic.
- Hints are optional, for example a word known to be in the plaintext.
Format. Teams of up to 3 get about 50 minutes on a written (or computer-based) exam and bring writing utensils only: no notes and no calculator in 2027. Each member gets a resource sheet; for K2 work, the English and Spanish letter-frequency tables are the parts you use.
How the cipher works
A K2 alphabet is a 26-letter cipher row written under the normal alphabet A to Z. You build it from a keyword:
- Write the keyword letters in order, dropping any letter that already appeared.
- Append every letter of the alphabet that is not yet used, in normal alphabetical order.
With the keyword QUARTZ, the first step gives Q U A R T Z and the second adds B C D E F G H I J K L M N O P S V W X Y. The cipher row is therefore:
Plain: 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
Cipher: Q U A R T Z B C D E F G H I J K L M N O P S V W X Y
Position n in the cipher row is the cipher letter for the plain letter at position n. In the simplest K2 alphabet the keyword starts the cipher row, but test writers may shift the whole keyed row by any amount against A to Z. Read the row as a circle: the keyword is the block just before the alphabetical run of unused letters, wrapping from the end back to the start if needed. Because the row is a permutation, each cipher letter has exactly one plaintext meaning, so decryption is a lookup, not a guess.
Encrypting and decrypting step by step
Encrypt:
- Build the cipher row from the keyword and write it under A to Z.
- For each plain letter, find its position n in the alphabet (A = 1, …, Z = 26) and write the cipher letter at position n of the cipher row.
- Copy spaces and punctuation unchanged.
- Check for self-maps. Exam alphabets never send a letter to itself; if your practice row does, pick another keyword or shift.
Decrypt:
- For each cipher letter, find its position n in the cipher row.
- Write the plain letter at position n of A to Z, copying spaces and punctuation.
- Read the result aloud. A wrong letter usually shows up as a word that almost works.
Both directions use the same table. On the exam you almost always work in the decryption direction.
Worked example
Plaintext: MEET AT NOON BRING THE MAPS
Cipher row (keyword QUARTZ), split for the page:
Plain: A B C D E F G H I J K L M
Cipher: Q U A R T Z B C D E F G H
Plain: N O P Q R S T U V W X Y Z
Cipher: I J K L M N O P S V W X Y
Encrypting
Each plain letter takes the cipher letter at the same position in the row. For the word MEET:
- M is the 13th letter, and the 13th cipher letter is H.
- E is the 5th letter, and the 5th cipher letter is T.
- T is the 20th letter, and the 20th cipher letter is O.
So MEET becomes HTTO. The whole message encrypts to:
HTTO QO IJJI UMDIB OCT HQKN
The spaces stay where they were. The double E of MEET and the double O of NOON survive as the double letters TT and JJ, which is exactly the kind of shape a solver watches for.
Decrypting
| Cipher letter | Position in cipher row | Plain letter |
|---|---|---|
| H | 13 | M |
| T | 5 | E |
| O | 20 | T |
| Q | 1 | A |
| I | 14 | N |
| J | 15 | O |
| U | 2 | B |
| M | 18 | R |
| D | 9 | I |
| B | 7 | G |
| C | 8 | H |
| N | 19 | S |
| K | 16 | P |
These 13 letters cover the whole message, which reads MEET AT NOON BRING THE MAPS.
Recovering the keyword
Once you have a cipher row you trust, read it as a circle. Find the alphabetical run of unused letters; the keyword is the block that sits just before that run. If the row has been shifted, the run may wrap from the end of the row back to the start, and the keyword may sit in the middle of the row. Here the row is unshifted: Q U A R T Z followed by B C D E F … Y, so the keyword is QUARTZ. For a K1, K2 or K3 aristocrat, a Division C question may ask for the keyword or key phrase instead of the plaintext. Answer whatever the question asks for. A keyword answer needs zero errors for full credit.
Solving under tournament conditions
Work the message the way a solver would in a timed packet, using the ciphertext above. You are not given the key, so you build it from patterns.
Step 1: word shapes. IJJI is four letters with the pattern ABBA. NOON is the common word with that shape, so guess I = N and J = O.
Step 2: short words. QO is a two-letter word, and AT is a common one. Guess Q = A and O = T.
Step 3: three-letter words. OCT fits THE, because O = T is already fixed. So C = H and T = E.
Step 4: a four-letter word with a double. HTTO has the pattern ABBC. MEET fits and agrees with the letters so far: H = M, T = E, O = T.
Step 5: a word with known letters. HQKN now reads M A _ _, which matches MAPS. That gives K = P and N = S.
Step 6: finish from the partial row. UMDIB, with I = N already known, fits BRING: U = B, M = R, D = I, B = G.
Every guess was checked against letters already placed, and no final mapping sends a letter to itself. Write each guess as a pair ("I to N") and cross out any pair that conflicts with an earlier one.
K2 rows outside the Aristocrat
The same row-building skill pays off on two other Division C question types:
- K2 Patristocrats. The row is built the same way, but you lose the word breaks, so you lean on letter frequencies, common digraphs (TH, HE, IN, ER) and the alphabetical tail of the row. Once a few cipher letters are placed, filling the tail is often faster than finding words.
- K2 Xenocrypts. The plaintext is Spanish, but the keyword alphabet is still English. Use the Spanish frequency column on the resource sheet (E and A lead, and short words such as DE, LA, EL, QUE and EN are common), then rebuild the English keyword exactly as in this guide to fill the rest of the row.
Strategy checklist
- Scan the packet for one-letter words first. In English, a one-letter word is usually A or I.
- Use word shapes before frequencies. Repeated letters in a word (ABBA, ABBC, AB CA) narrow the candidates faster than letter counts.
- Use the English letter frequency chart on your resource sheet to rank the most common cipher letters, then test the top few against common words such as THE, AND and TO.
- Use the no-self rule to delete guesses. If a cipher letter appears inside a word where the plain letter would be the same letter, reject that guess.
- Mark apostrophes; contractions such as I'M and DON'T give quick letters.
- Use the alphabetical tail. After the keyword, the cipher letters rise in A-to-Z order as the plain letters rise. In the QUARTZ row, plain I, J, K map to D, E, F. So once you know two pairs from the tail, the plain letters between them map to the cipher letters between them, minus any keyword letters. In a shifted row the tail can wrap around from Z back to A, so follow it around the end of the row.
- Keep every confirmed pair in one 26-letter line so the keyword becomes visible.
- Test a nearly complete row by re-encrypting one word.
What the rules score
The high score wins. A team's final score is the exam score plus the timing bonus plus any special bonus.
- Errors. Two or fewer errors in the decoded plaintext earn full credit. Each additional error costs 100 points, and a question never scores below zero. A 400-point Aristocrat with 5 errors earns 400 − 3 × 100 = 100 points; with 7 errors it earns 0.
- Keyword answers. For a K1, K2 or K3 aristocrat, a keyword or key phrase answer must have zero errors for full credit. Each error in the keyword costs 100 points, and the penalty never goes beyond the question's value.
- Timed first question. The timing bonus is 2 × (600 − seconds), counted from the start of the event until the team submits an answer with two or fewer errors. Wrong submissions carry no penalty, but the clock keeps running. After 10 minutes the question can still be answered for its normal points, with no bonus.
- Special bonus. Up to three questions that are not Aristocrats, Patristocrats or Xenocrypts; each must be solved with no penalty points (one = 150, two = 400, three = 750). A K2 problem cannot earn it.
- Tiebreakers. The event supervisor picks tiebreak questions in advance and compares score, then degree of correctness, then number attempted.
Common pitfalls
- Confusing the cipher row with the plaintext row. The keyword sits in the cipher row, not in A to Z. Read the cipher letter as the lookup key.
- Expecting the keyword at position 1. The row may be shifted. Read it as a circle; only a row whose unused letters break alphabetical order signals a mapping error.
- Splitting the keyword at the wrong point. A keyword ending in letters such as B or C can make the split ambiguous. If two splits fit, test both on a full word.
- Trusting one common word. Confirm a guess such as THE with at least two other words.
- Assuming every Division C aristocrat is K2. The alphabet type (K1, K2, K3 or random) determines the cipher row. Check which one the packet uses before you rebuild a row from a keyword.
Practice ciphertexts
Try each one before reading the answer. The answers include the keyword, which a Division C question may ask for instead of the plaintext.
References and further reading
- Science Olympiad (soinc.org): the current Codebusters Division B and C manuals and the event pages, which define the allowed code types and scoring.
- American Cryptogram Association (cryptogram.org): the keyed-alphabet conventions (K1, K2, K3) that the rules refer to. Check the K2 layout here.
- SciOly Wiki, Codebusters: community notes on the event. Read it for context; this guide does not reproduce it.
- Substitution cipher (Wikipedia): background on monoalphabetic substitution and frequency analysis.
- Simon Singh, The Code Book (1999): a readable history of substitution ciphers and their solution.