Homophonic Cipher
Understand how one plaintext letter can map to several number symbols while every number still identifies only one plaintext letter.
What is the Homophonic Cipher?
The Science Olympiad-style Homophonic cipher uses a four-letter keyword with four unique letters. Every plaintext letter has four possible number values—one in each of the ranges 1–25, 26–50, 51–75, and 76–100—with I/J sharing one alphabet position.
The important one-way rule is unchanged: each ciphertext number decodes to only one plaintext letter. Because repeated plaintext letters can choose different values from their four-number set, ordinary single-symbol frequency analysis becomes less obvious.
The cipher mechanics on this page are self-contained. Science Olympiad event formats, allowed variants, and tournament constraints can change by season; the current official Rules Manual and official clarifications take precedence.
No outside reference is assumed. Work through Foundations → Complete Reference → Encryption → Decryption in order, then use the competition and cryptanalysis sections.
What you need to know
- Each plaintext letter owns four ciphertext values, one in each 25-number band; I/J share a position.
- One ciphertext token must not decode to multiple plaintext letters in the same mapping.
- Encryption may choose randomly among a letter’s allowed tokens; decryption is deterministic once the mapping is known.
Beginner glossary
| Term | Meaning |
|---|---|
| Homophone | One of several ciphertext symbols that can represent the same plaintext letter. |
| Token | A ciphertext number such as 17, 42, 66, or 90. |
| Reverse mapping | A token→plaintext table used for deterministic decoding. |
| Frequency flattening | Spreading common letters over multiple symbols so no single token is as frequent as the original letter. |
Numeric Homophonic cipher number bands and keyword table
The working alphabet has 25 positions because I/J share one position:
Choose a four-letter keyword with four unique letters. Its first letter receives 1, its second receives 26, its third receives 51, and its fourth receives 76. Continue forward through the 25-letter alphabet inside each number band, wrapping around after Z.
C=1, O=26, D=51, and E=76. That determines the entire table below. A solver who recovers the keyword can reconstruct all 100 number assignments.
| Plain | 1–25 band | 26–50 band | 51–75 band | 76–100 band |
|---|---|---|---|---|
| A | 24 | 38 | 73 | 97 |
| B | 25 | 39 | 74 | 98 |
| C | 1 | 40 | 75 | 99 |
| D | 2 | 41 | 51 | 100 |
| E | 3 | 42 | 52 | 76 |
| F | 4 | 43 | 53 | 77 |
| G | 5 | 44 | 54 | 78 |
| H | 6 | 45 | 55 | 79 |
| I/J | 7 | 46 | 56 | 80 |
| K | 8 | 47 | 57 | 81 |
| L | 9 | 48 | 58 | 82 |
| M | 10 | 49 | 59 | 83 |
| N | 11 | 50 | 60 | 84 |
| O | 12 | 26 | 61 | 85 |
| P | 13 | 27 | 62 | 86 |
| Q | 14 | 28 | 63 | 87 |
| R | 15 | 29 | 64 | 88 |
| S | 16 | 30 | 65 | 89 |
| T | 17 | 31 | 66 | 90 |
| U | 18 | 32 | 67 | 91 |
| V | 19 | 33 | 68 | 92 |
| W | 20 | 34 | 69 | 93 |
| X | 21 | 35 | 70 | 94 |
| Y | 22 | 36 | 71 | 95 |
| Z | 23 | 37 | 72 | 96 |
How to read the table
When encrypting E, any of its four values may be chosen. When decrypting, each of those four values points back to E. A number can never represent two different plaintext positions.
How encryption works
Find the plaintext letter
Example: E.
Look at its token set
E may have several assigned numbers.
Choose one allowed token
The encoder can vary the choice each time E appears.
Repeat
Different occurrences of the same plaintext letter may therefore look different in ciphertext.
How to decode a numeric Homophonic cipher
Use the number→letter mapping
Each token belongs to exactly one plaintext letter.
Replace every token
Different numbers may collapse to the same plaintext letter.
Restore spacing if indicated
Token separators make boundaries unambiguous at the symbol level.
Read the result
Check that the full plaintext is coherent.
How to approach it in Codebusters practice
- Do not assume repeated plaintext letters produce repeated ciphertext tokens.
- For cryptanalysis, aggregate symbols that appear to behave like homophones rather than treating every number as an independent simple-substitution letter.
- Word-pattern clues may be weakened because equal plaintext letters can have different ciphertext tokens.
What the problem gives you vs. what you produce
| Part | What to expect |
|---|---|
| You may be given | Number ciphertext plus either partial information about the four-letter keyword (decode) or a plaintext crib at a stated location (cryptanalysis). |
| You must find | The plaintext; while solving, reconstruct enough of the four-band keyword mapping to support it. |
| Fastest first move | Separate values into the four 25-number bands, place the supplied keyword/crib information, and propagate consistent rotations across the bands. |
Recover the hidden keyword structure
- First split every cipher number into its band: 1–25, 26–50, 51–75, or 76–100. Each band is the same 25-letter alphabet rotated to a different keyword anchor.
- For a decode, use the supplied keyword letters as constraints on a four-letter word. If positions are supplied, place them immediately; if not, test plausible positions.
- For cryptanalysis, line the supplied plaintext crib up with the stated cipher-unit location. Each known plaintext↔number pair fixes a position in one band and therefore constrains one keyword letter.
- Repeated plaintext letters can use different numbers, so do not expect ordinary Aristocrat repeated-symbol patterns. Combine proven homophones before interpreting frequency.
Keyword CODE: encrypt and reverse one short example
C=1, O=26, D=51, E=76T → {17,31,66,90}; E → {3,42,52,76}TEE66 3 52Before moving on, make sure you can answer these without another site:
- Why are there four number bands of 25 values?
- With keyword CODE, why does E have values 3, 42, 52, and 76?
- Can two different numbers both mean E? Yes. Can one number mean both E and T? No.
Common mistakes
Assuming equal plaintext letters must have equal ciphertext tokens.
Allowing one number to represent two plaintext letters.
Using ordinary one-symbol-per-letter frequency analysis without combining suspected homophones.
Ignoring token boundaries.
Competition speed strategies
Build a reverse number→letter table as soon as mappings are known.
Group values by their 25-number band and use the four-letter keyword rotation to connect them.
Use the supplied keyword letters or crib before relying on frequency; the four-band structure is stronger evidence.
What to remember under time pressure
Homophonic cipher visualizer and practice
Use the lab to change inputs and keys, keep the relevant reference material visible, inspect each intermediate transformation, and then read the “How to reverse it” panel so encryption and decryption connect.