Codebusters - K1 Aristocrat

A K1 Aristocrat is a monoalphabetic substitution: every plaintext letter is always replaced by the same cipher letter, everywhere in the message. The substitution table comes from one keyword, and the word spaces are left in place, which is what the rules mean by an Aristocrat with spaces included. The timed first question on every 2027 Codebusters exam is an Aristocrat, and K1 is one of the alphabets that can be used for it, so the speed of your first solve sets the timing bonus. The same K1 alphabet also drives Patristocrats and Spanish Xenocrypts. Learn to build the alphabet quickly, and the rest of the cipher is pattern work.

What the rules cover

Under the 2027 rules, K1 alphabets appear in both divisions at the Regional level, and every Regional code type carries into State and National. The table summarizes where they show up and how the answer is scored, with the 2027 section numbers.

Teams have up to 3 members and about 50 minutes. The event allows no notes, no calculator and no tools beyond writing utensils and what the event supervisor hands out. Each team member gets a resource sheet with the tables the exam needs, including English and Spanish letter frequencies, so you do not need to memorize a frequency table, but you do need to build alphabets from memory and by hand.

Where else the K1 alphabet appears

The same keyed alphabet is reused in two other 2027 question types, so the construction skill below pays off three times.

In Division B, the K1 alphabet is the only keyed alphabet on the list, so every keyed Aristocrat, Patristocrat and Xenocrypt you meet will be K1.

How a K1 alphabet is built

In the ACA's naming, K1 means the plaintext alphabet is keyed and the ciphertext alphabet is the plain A to Z. (K2 is the reverse, with a keyed ciphertext alphabet, and K3 keys both rows with the same keyword.) You build the keyed plaintext row from the keyword in two steps:

1. Write the keyword from left to right. Skip any letter already written, so only the first copy of a repeated letter counts.
2. Write every letter of A to Z that has not yet appeared, in alphabetical order.

For the keyword ZEBRAS, step 1 gives Z E B R A S (no repeats). Step 2 adds the 20 unused letters, C D F G H I J K L M N O P Q T U V W X Y. The two rows line up like this:

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
Plain   Z E B R A S C D F G H I J K L M N O P Q T U V W X Y

Each plaintext letter in the lower row is replaced by the cipher letter directly above it. In this layout the keyword sits at the front of the plain row, so cipher A stands for the first letter of the keyword, cipher B for the second, and so on.

This zero-offset layout is the simplest case, not the only one. Under the ACA definition the keyed plaintext row may be shifted against the A to Z row, so the keyword can start under any cipher letter, with the row wrapping from the end back to cipher A. Test writers choose the shift so that no letter maps to itself, which rule 3.g requires for Aristocrats, Patristocrats and Xenocrypts. The shift matters in practice: if a keyword has no Z, Z is the last letter of the tail, and with no shift it sits at position 25 and encrypts to itself. Expect most tournament K1 alphabets to be shifted.

Why the tail of the row matters

After the keyword letters, the keyed row runs in alphabetical order. So the cipher letters near the end of the alphabet decode to plaintext letters that also increase alphabetically (skipping any letters used in the keyword). In the ZEBRAS row, cipher M, N, O and P decode to J, K, L and M in order, and cipher T through Z decode to Q, T, U, V, W, X and Y in order. This gives a solving shortcut covered below.

It also explains rule 3.g. A keyword whose keyed row leaves letters in their own alphabet positions would make those letters encrypt to themselves, which the rules forbid for Aristocrats. Keyword MAGNET is an example: its row is MAGNETBCDFHIJKLOPQRSUVWXYZ, so E, U, V, W, X, Y and Z all map to themselves. Shifting the row is how test writers avoid this.

Encrypting step by step

Use this to make practice messages:

1. Build the keyed row from the keyword.
2. Write the plaintext in capitals and keep the word breaks.
3. For each plaintext letter, find it in the keyed row and copy the letter of the plain alphabet at the same position. Word spaces stay in place, so word lengths survive encryption.
4. Check that no letter encrypts to itself. If one does, the keyword breaks rule 3.g.

Worked example. Keyword ZEBRAS, plaintext MEET ME AT NOON.

The ciphertext is PBBU PB EU QRRQ. The repeated E's become repeated B's and the repeated O's repeated R's, which is why repeated plaintext letters stay visible as repeated cipher letters.

Decrypting step by step

1. Build the keyed row and write the plain A to Z above it.
2. Take a cipher letter and find it in the A to Z row. Its position is i.
3. The plaintext letter is the keyed-row letter at position i.
4. Repeat for every letter and keep the word spaces.
5. Read the result aloud. A single misplaced letter usually shows up as an impossible word.

Worked example. Keyword ZEBRAS, ciphertext PBBU PB EU QRRQ.

Applying the table gives M E E T, M E, A T, N O O N, which is MEET ME AT NOON.

Solving under tournament conditions

You solve from the ciphertext alone, so work from the cheapest clues to the most expensive.

Read the word shapes first

Look at word lengths and repeated letters before counting anything. Spaces are kept, so a one-letter cipher word is almost certainly A or I. Common two-letter words include OF, TO, IN, IT, IS, BE, AS, AT, ON, OR and BY. Three-letter cipher words are often THE, AND, FOR or NOT. Apostrophes survive too, so an ending such as 'S, 'T or 'LL is a strong clue.

A repeated-letter pattern narrows the candidates sharply. The cipher word QRRQ has the pattern ABBA, which fits NOON, TOOT and ANNA. Check each candidate against letters you have already placed.

Use the hint if there is one

The rules allow an Aristocrat to be given with or without a hint. A hint usually names a word or phrase in the plaintext, or tells you a few letter pairs. Place the hinted letters in your decryption table first, then fill in every other cipher word that uses them.

Use frequency to rank the candidates

The exam packet includes an English letter-frequency sheet. In ordinary English, E is the most common letter, followed by T, A, O, I, N, S, H and R.

In a short Aristocrat the most frequent cipher letter is not always E, so let word shapes break ties. Once you have a likely E and T, THE, THAT and THEN often appear quickly.

Exploit the K1 structure

Because the keyed row is the keyword followed by an alphabetical tail, K1 puzzles leak letters that other alphabets do not. Once one cipher letter in the tail is solved, its neighbors follow. Suppose you know cipher T is plain Q and cipher U is plain T. The next cipher letter V must be the next unused plain letter after T, which is U (unless U appears in the keyword). This lets one correct guess confirm or fix several others, and it is how you recover the whole keyword for a keyword answer.

Apply the no-self rule

No letter may decrypt to itself (3.g). Reject any guess that pairs a cipher letter with the plaintext letter of the same name. This removes candidate words quickly, so run it on every new guess.

Keyword answers (Division C)

Under 3.e.ii, a K1 question may ask for the keyword instead of the plaintext. Write the plain letters in cipher order, wrapping from Z back to A. Find the alphabetical run of unused letters; the keyword is the block of letters just before the start of that run (reading cyclically). Do not assume the keyword starts under cipher A, because the row is usually shifted. With no shift, ZEBRAS sits under cipher A to F, followed by the run C D F G and so on. A keyword answer needs zero errors for full credit, and each wrong letter of the keyword costs 100 points (4.e), so check each letter against the ciphertext before you write it.

Timing and scoring

The first question is timed, and the timing bonus is the key scoring idea in this event. Your final score is the exam score plus the timing bonus plus any special bonus (4.b). Under 3.h and 4.f, the clock runs from the start of the event until the team gives an answer to the first question with two or fewer errors, and the supervisor records the time in seconds, as precisely as the timer allows. A team member signals the solve in the way the supervisor announces before the exam.

Worked example. A team's first answer, given at 250 seconds, has three errors and is not accepted. The team keeps working, and at 380 seconds it submits a version with two errors, which counts as correct. The timing bonus is 2 × (600 − 380) = 2 × 220 = 440 points. Had the first answer been correct at 250 seconds, the bonus would have been 2 × 350 = 700 points.

A wrong answer to the timed question can be retried as often as needed without penalty (3.h.v), but the clock keeps running, so an early wrong answer costs time. After 10 minutes the question still earns its normal exam points; only the bonus is gone.

Common pitfalls

How tournaments test this

No archived question counts are available for K1 Aristocrats, so this guide does not quote frequencies. What the 2027 rules fix is:

• The first question is always an Aristocrat with spaces, and the timing bonus depends only on that question. Expect it to use a K1, K2, K3 or random alphabet in Division C and a K1 or random alphabet in Division B.
• K1 is available at Regionals and carries into State and National, because every Regional code type does.
• Division C may ask for the keyword of a K1, K2 or K3 Aristocrat, scored with zero errors allowed. Division B never does.
• Aristocrats cannot be special bonus questions, so their value is the exam points plus, for question 1, the timing bonus.

Log your practice solves with the time and error count to track your first-question speed.

Practice

Solve these without the key, then check against the answers.

References and further reading

• Science Olympiad (soinc.org): the current Codebusters manuals and event pages.
• American Cryptogram Association (cryptogram.org): the source of the alphabet definitions the manual refers to.
• Simon Singh, The Code Book (1999): an accessible history of substitution ciphers and frequency analysis.
• SciOly Wiki (scioly.org): the community Codebusters page.

See also

• Codebusters overview
• K1 Patristocrat: the same alphabet with spaces removed and letters grouped in fives.
• K2 Aristocrat and random Aristocrat: the same method with other alphabets.