Codebusters - K3 Aristocrat

A K3 Aristocrat is a monoalphabetic substitution: every plaintext letter is always replaced by the same ciphertext letter everywhere in the message. What makes it a K3 is how the replacement table is built: one keyword makes a scrambled alphabet, and the cipher row is that same scrambled alphabet slid sideways by a fixed shift. Spaces and punctuation are kept, so the ciphertext shows the word lengths of the original message, and that is the main handle a solver has on it.

What the rules cover

Codebusters is a written (or computer-based) exam for teams of up to 3, lasting about 50 minutes. Teams bring only writing utensils: no notes, no resource binder and no calculator of any kind. The supervisor hands each team member a resource sheet that, in Division C, can include English and Spanish letter-frequency tables, which is exactly the table you want for an Aristocrat.

The 2027 Division C rules that matter for a K3 Aristocrat:

The timed question is an Aristocrat, so in Division C it can be built on a K1, K2, K3 or random alphabet.

How a K3 alphabet is built

In the ACA system, a K1 alphabet keys the plain row, a K2 keys the cipher row, and a K3 keys both rows with the same keyword. A K4 (two different keywords) is a separate ACA type that is not in the Codebusters code list. The K3 recipe has three steps:

1. Write the keyword, dropping any letter you have already written.
2. Append the letters of A–Z that the keyword did not use, in alphabetical order. This 26-letter string is the keyed alphabet.
3. Copy the keyed alphabet to make the cipher row, then slide it right by a shift $s$: the last $s$ letters move to the front. The shift is never 0, which is why no letter can map to itself.

The example uses keyword ZEBRA and a right shift of 4. The plain row is the keyed alphabet; the cipher row is the same letters slid right by 4.

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

The rows are linked by position: the plain letter at index $i$ is replaced by the cipher letter at index $i$. Because the cipher row is just the plain row shifted, a plain letter becomes the letter that sits $s$ places earlier in the keyed alphabet (wrapping around).

Encryption, step by step

1. Build the keyed alphabet from the keyword and write it as the plain row.
2. Slide a copy right by the shift to make the cipher row.
3. Keep every space and punctuation mark exactly where it is.
4. For each plaintext letter, find its index (0 to 25) in the plain row.
5. Write the cipher row letter at that index.

Worked encryption: MEET ME AT NOON

ME becomes IW. AT becomes ZO, because A is at index 4 (cipher letter Z) and T is at index 20 (cipher letter O). NOON becomes JKKJ, because N is at index 15 (cipher letter J) and O is at index 16 (cipher letter K). The full ciphertext is:

IWWO IW ZO JKKJ

Decryption, step by step

1. With the keyword and shift, build the same two rows.
2. For each ciphertext letter, find its index in the cipher row.
3. Write the plain row letter at that index.

Worked decryption: IWWO IW ZO JKKJ

Continuing the same way, Z is at index 4 and gives A, J is at index 15 and gives N, and K is at index 16 and gives O. The recovered plaintext is MEET ME AT NOON.

Solving under tournament conditions

Solvers are not given the keyword or shift, so the work is to rebuild both. Use a 26-column worksheet with the plain letter on top and the cipher letter below, and write each confirmed pair in its column.

Start with the structure of the message, exactly as for any Aristocrat:

• Single-letter words. A one-letter ciphertext word is nearly always A or I. Test both.
• Word shapes. Look at repeated letters inside each word. A frequent three-letter word is a strong candidate for THE or AND. Double letters, apostrophes and common endings such as -ED and -ING also narrow the choices.
• Letter frequency. Count how often each ciphertext letter appears. The figure below shows that English letters are used very unevenly, so the most frequent ciphertext letters are likely E, T, A, O, N. Treat this as a first guess and confirm with words.
• The no-self rule. Use rule 3.g to discard guesses. If a guess would make a ciphertext letter decrypt to itself, it is wrong.

What is special about K3

Two facts make a K3 easier than a random alphabet once you have a few pairs.

• The shift is one number. Every pair obeys the same rule: the cipher letter is $s$ places earlier in the keyed alphabet than the plain letter. One reliable pair does not give $s$ by itself, because you do not yet know the keyed alphabet, but pairs from the alphabetical tail do (next point).
• The tail is alphabetical. After the keyword letters, the keyed alphabet runs in ordinary A–Z order with the keyword's letters skipped. So the cipher letters are the same alphabetic distance apart as the plain letters only when both the plain letters and their cipher letters ($s$ places earlier) lie in the alphabetical tail, with no keyword-removed letter in either span. In the example, N → J fixes a letter offset of 4 for nearby tail letters whose cipher letters are also in the tail, so O → K, P → L, Q → M and M → I follow at once. Near the start of the tail the rule fails: I → D but J → F, because E (a keyword letter) is missing between D and F. Within those limits, a run of consecutive letters in the plaintext maps to a run of consecutive letters in the ciphertext.

When you confirm a pair like N → J, test whether neighboring letters (O → K, M → I) fit your words. Runs break where a keyword letter was removed (here between Q and S, since R is in the keyword), and that break points to the keyword.

Keyword recovery. The leftover letters that do not fit the alphabetical runs spell the front of the keyed alphabet. If the plain row begins with a recognizable word, test it as the keyword. Because a keyword answer needs zero errors (rule 4.e), check each letter against your rows before writing it.

Time. On the timed question retries are free, so submit as soon as at most two letters could be wrong.

Common pitfalls

Division and level notes

• Division C, all levels: K3 Aristocrats can be any regular question, the timed first question, or a keyword-answer question. Regional, State and National exams all draw on the same Aristocrat rules.
• Division C, never as K3: Patristocrats (K1 or K2 only) and Xenocrypts (K1 or K2 only).
• Division B: no K3 alphabets anywhere; Aristocrats there are K1 or random.
• State and National: harder cryptanalysis is added elsewhere on the exam, so a fast Aristocrat routine buys time for it.

How tournaments test this

There are no archived K3 Aristocrat questions to count yet, so this guide cannot give question-type statistics. What the 2027 rules guarantee: the first, timed question is an Aristocrat, Division C Aristocrats may use a K3 alphabet, and a K1, K2 or K3 Aristocrat may ask for the keyword or key phrase instead of the plaintext, scored with zero errors allowed.

Practice ciphertexts

Each message below is a K3 Aristocrat. Solve it, then check the key.

References and further reading

• American Cryptogram Association, the source of the K1, K2 and K3 alphabet definitions: https://www.cryptogram.org/
• Science Olympiad 2027 rules manual, Codebusters C (the code list in section 3.e and scoring in section 4): https://www.soinc.org/
• Wikipedia, "Substitution cipher," for the general monoalphabetic model: https://en.wikipedia.org/wiki/Substitution_cipher
• Wikipedia, "Frequency analysis," for the letter-frequency method behind the figure: https://en.wikipedia.org/wiki/Frequency_analysis
• SciOly Wiki, for community notes on Codebusters code types: https://scioly.org/wiki/