Codebusters - K1 Patristocrat
On this page(9 sections)
A K1 Patristocrat is a monoalphabetic substitution: each plaintext letter is replaced by one fixed ciphertext letter everywhere in the message, and the replacement alphabet is built from a keyword. It is an Aristocrat with the word breaks removed. The spaces are gone, and the ciphertext is written in blocks of five, so you have to recover where the words are while keeping the letter mapping consistent. Under the 2027 rules it is a Regional code type in both divisions, and because every Regional type carries forward, it can appear at State and National too. In Division B it is the only Patristocrat alphabet allowed.
What the rules cover
The 2027 rules list the Patristocrat as the second kind of monoalphabetic substitution (3.e.i.(2)), next to the Aristocrat. The definition did not change from last season. The table shows where the K1 form sits, with the 2027 section numbers.
| Item | Division B | Division C |
|---|---|---|
| Patristocrat alphabets | K1 only (3.e.i.(2)) | K1 or K2 (3.e.i.(2)) |
| Ciphertext form | Spaces removed, letters in groups of 5 | Same |
| Hint | May or may not be given (3.e.i) | Same (3.e.i) |
| Regional / Invitational | Allowed (3.e.i) | Allowed (3.e.i) |
| State & National | All Regional types carry over (3.f.i) | Same (3.f.i) |
| No self-decryption | No letter decrypts to itself (3.g) | Same (3.g) |
| Timed first question | Always an Aristocrat, never a Patristocrat (3.h) | Same (3.h) |
| Special bonus | Patristocrats are never special bonus questions (3.i) | Same (3.i) |
| Keyword as the answer | Not allowed | Only for Aristocrats (3.e.ii), so not for Patristocrats |
| Scoring | 2 or fewer errors for full credit, then 100 points per extra error (4.d) | Same (4.d) |
Event conditions that affect this cipher
Teams bring only writing utensils (2.a): no notes, no binder and, new for 2027, no calculator of any class (2.b). Each team member gets a resource sheet with English and Spanish letter frequencies (2.d), which is the table you will use here. The packet is printed single-sided so pages can be split (2.c), the exam may be on paper or on a computer (3.a), and questions may be answered in any order (3.d).
How the cipher works
The plaintext is the message, the ciphertext is what the puzzle gives you, and the keyed alphabet is a 26-letter row built from a keyword that defines the mapping. Because the mapping is fixed, the cipher keeps the letter frequencies and patterns of English. Removing the spaces hides only the word boundaries. That gives the whole solving problem a simple shape: frequency tells you the letters, and language tells you the words.
Building the K1 keyed alphabet
In the American Cryptogram Association's naming, which the rules adopt, the number says which alphabet is scrambled. In K1 the plaintext alphabet is the keyed one, and the ciphertext alphabet is plain A to Z. (In K2 it is the other way round.)
- Write the keyword, dropping any letter that already appeared. Keep the first occurrence.
- Append the letters of A to Z that the keyword did not use, in alphabetical order. The keyed alphabet now has 26 different letters.
- Write the keyed alphabet on top as the plaintext row, and plain A to Z directly below it as the ciphertext row. Each plaintext letter has exactly one partner below it.
The keyed row may also be shifted so the keyword starts above some letter other than A. This is still K1, and a shift is the usual way to avoid self-encryptions. When you recover the alphabet, look for the keyword as a run of letters somewhere in the plaintext row, wrapping around the end if needed.
Example with the keyword ZEBRA:
Plain: Z E B R A C D F G H I J K L M N O P Q S T U V W X Y
Cipher: 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 keyed row has 26 letters, and no letter sits directly above itself, so this alphabet is legal under rule 3.g.
Encryption, step by step
- Remove spaces and punctuation, and write the plaintext in capitals.
- For each plaintext letter, find it in the keyed (top) row and copy the letter directly below it from the A to Z row.
- Write the output in groups of five. The last group may be shorter.
- Check rule 3.g. If any letter encrypts to itself, the alphabet cannot be used for a puzzle, so change the keyword or shift the keyed row.
Decryption, step by step
- Find each ciphertext letter in the A to Z (bottom) row; its position is just its place in the alphabet.
- Read the keyed-row letter at that same position.
- Insert word breaks where the plaintext reads as words.
Worked example: encryption
Plaintext: WE WILL MEET AT THE LIBRARY, with keyword ZEBRA. Remove the spaces to get WEWILLMEETATTHELIBRARY (22 letters). The full mapping for this keyword is below, in two halves to keep the table narrow.
| Plain → Cipher | Plain → Cipher |
|---|---|
| A → E | N → P |
| B → C | O → Q |
| C → F | P → R |
| D → G | Q → S |
| E → B | R → D |
| F → H | S → T |
| G → I | T → U |
| H → J | U → V |
| I → K | V → W |
| J → L | W → X |
| K → M | X → Y |
| L → N | Y → Z |
| M → O | Z → A |
Now encrypt the plaintext letter by letter:
Worked example: decryption
Ciphertext: XBXKN NOBBU EUUJB NKCDE DZ. Build the reverse table first (the same mapping read from the other side) so you can look up each ciphertext letter directly.
| Cipher → Plain | Cipher → Plain |
|---|---|
| A → Z | N → L |
| B → E | O → M |
| C → B | P → N |
| D → R | Q → O |
| E → A | R → P |
| F → C | S → Q |
| G → D | T → S |
| H → F | U → T |
| I → G | V → U |
| J → H | W → V |
| K → I | X → W |
| L → J | Y → X |
| M → K | Z → Y |
Solving strategies
On the exam you get the ciphertext and no keyword, so the real skill is cryptanalysis. A good solver works in a loop: assume a letter, test it against the whole message, and keep only the assumptions that stay consistent.
Start with letter counts
Count each ciphertext letter and match the most common ones to the most common English letters, using the frequency table on your resource sheet. E leads at roughly 13 percent, followed by T and A near 9 and 8 percent. Short messages vary a lot, so treat these as first guesses.
Use doubles and short words
In English, EE, LL, SS, OO, and TT are common doubles, so a ciphertext letter that appears twice in a row is a good candidate for one of them. Common short words such as THE, AND, THAT, IS, IT, AT, TO, and ON leave recognizable strings even without spaces. THE is the most useful: a three-letter ciphertext string that repeats several times is often THE.
Use the no-self rule
Rule 3.g says no letter can decrypt to itself in a Patristocrat, so any hypothesis that maps a letter to itself can be rejected at once.
Keep a two-way table
Write the ciphertext alphabet A to Z with a blank under each letter for its plaintext partner. The mapping is one-to-one, so before you assign a pair, check that neither letter is already used; a repeat means a wrong guess.
Use suffixes and patterns
Word endings such as -ING, -ED, -ER, -LY, and -TION are easy to spot once the spaces are gone. A repeated letter pattern such as ABCA can point to words like THAT, SAYS, or EASE. Test a suffix guess across the whole message, not just one spot.
Exploit the keyed alphabet
K1 has structure you can use. After the keyword, the plaintext row runs in alphabetical order. So as you move along the ciphertext alphabet A, B, C, and so on, the plaintext letters they stand for mostly climb through the alphabet too, with gaps where a letter was used by the keyword. In the ZEBRA example, cipher F, G, H, I, J, K, L, M stand for C, D, F, G, H, I, J, K. Once you know two solved pairs, the pairs between them are squeezed into a narrow range of plaintext letters, which can settle a stubborn letter. A run that breaks the alphabetical climb usually marks the keyword.
Timing and exam conduct
The exam runs for about 50 minutes. Only the first question, an Aristocrat, is timed (its clock runs from the start of the event), so Patristocrats are untimed. Because the packet comes apart, one teammate can take the monoalphabetic pages while others work the special-bonus candidates. If a Patristocrat shows no readable words after a long stretch, move on and return later. Two or fewer errors still earn full credit, so do not burn time on a last unsure letter.
Common pitfalls
Looking up the letter in the wrong row
Encryption finds the plaintext letter in the keyed (top) row and copies the letter below it. Decryption finds the ciphertext letter in the A to Z (bottom) row and reads the letter above it. Mixing the two directions, or using a K2 layout by mistake, produces a message that looks almost right but has no word structure.
Keeping duplicate keyword letters
A keyword such as SCIENCE contains the letters C and E twice. The keyed alphabet uses only the first of each. If you keep both, the row no longer has 26 different letters and the mapping breaks.
A keyword whose tail is unchanged
The keyed row is the keyword followed by the unused letters in order, so its tail can line up with the A to Z row. With SCIENCE the keyed row is SCIENABDFGHJKLMOPQRTUVWXYZ, and the last seven letters T to Z sit directly above themselves. Those are self-encryptions, which rule 3.g forbids, so a puzzle writer must shift the row. Check every keyword for self-matches before you rely on it.
Treating the five-letter groups as words
The groups are cosmetic. Word boundaries do not fall at the group edges, and a word can split across two groups. Solve the whole run as one string.
One wrong pair cascades
A single wrong assignment makes every occurrence of that ciphertext letter wrong at once. Each wrong letter counts as an error, so one bad pair can push you past the two-error allowance. Test each new pair against the whole message before you commit to it.
Answering with the keyword
In Division C, only an Aristocrat question may ask for the keyword (3.e.ii). A Patristocrat is always answered with the decoded plaintext. Read the question wording before you write.
Scoring and what the rules allow
Each question is worth a fixed value printed on the exam. Under rule 4.d, two or fewer errors in the decoded plaintext earn full credit. Each additional error costs 100 points, and the penalty stops at the question value, so a question cannot go negative.
The final score is the exam score plus the timing bonus plus the special bonus (4.b). A Patristocrat is never the timed question and never a special bonus question, so it adds only its question value to the exam score. In 2027 at least one special bonus question must be a Homophonic cipher (3.i), which is a reason to finish monoalphabetic questions efficiently and leave time for it.
How tournaments test this
The 2027 rules fix the form: a single keyed substitution with the spaces removed and the letters grouped in fives, K1 in Division B and K1 or K2 in Division C, at every level. A question may come with a hint (for example, a word known to be in the plaintext) or with none at all (3.e.i), so practice both. Expect a full English message as the plaintext, and expect to solve it without a calculator or notes, using only the resource sheet.
Test yourself
Each practice ciphertext below uses a legal K1 alphabet that leaves no letter in place. Solve each one by hand, then check your answer.
References and further reading
- Science Olympiad: the Codebusters event page and the 2027 rules manual, which set the rule numbers cited above.
- American Cryptogram Association: the body the rules cite for the K1 keyed-alphabet definition.
- Letter frequency, Wikipedia: English letter frequencies used for the first-guess ranks. Exact values vary by corpus, so use the resource sheet on the exam.
- Substitution cipher, Wikipedia: general background on monoalphabetic substitution.