3.1 Letter Codes & Cryptographic Shifts

3.1 Letter Codes & Cryptographic Shifts

At a Glance: Cryptographic shift questions assess your working memory, mental agility, and pattern recognition by encoding words through systematic alphabetical transformations. Under Edutest's intense 30-second pacing, calculating letter positions by finger-counting guarantees failure. Mastering numerical mapping ($A=1$ to $Z=26$), the Rule of 27 for complement pairs, and letter-frequency deduction allows you to decrypt codes in seconds.

---

The Cryptographic Landscape on the Edutest Paper

Edutest's Verbal Reasoning test lasts 30 minutes, and Edutest states that actual tests contain between 40 and 60 questions, so the average pace is 30 to 45 seconds per item. Edutest does not publish how many items use each format, but letter codes are a common way scholarship tests assess word relationships and deduction. Unlike standard vocabulary items that test semantic knowledge, cryptography evaluates fluid symbolic reasoning: your capacity to recognise mathematical, positional, and directional transformations applied to language.

Code items in reasoning tests commonly use five typologies:

1. Constant Caesar Ciphers: Uniform forward or backward positional shifts across all letters in a word.
2. Progressive Shift Ciphers: Step sizes that systematically increase or decrease across successive letter positions (e.g. $+1, +2, +3, +4$).
3. Interleaved Dual-Rule Ciphers: Odd-positioned letters follow one transformation rule, while even-positioned letters follow a separate, independent rule.
4. Complement / Reverse-Alphabet Ciphers: Letters are paired with their symmetrical mirror counterparts from the opposite end of the alphabet.
5. Group Word-Code Mapping: A set of four plain English words must be mapped to four letter- or digit-based codes through positional frequency deduction without complete translation.

To solve these problems in under 30 seconds, you must replace finger-counting with structured mental anchors.

---

Alphabetical Positioning & Numerical Mapping

Every English letter corresponds to a unique ordinal position from 1 to 26. Fluency in this forward index is non-negotiable.

The EJOTY Benchmark Anchor System

Memorising all 26 positions cold can feel daunting under timed stress. Instead, master the EJOTY mnemonic, which anchors every fifth letter in the alphabet:

$\mathbf{E}=5, \quad \mathbf{J}=10, \quad \mathbf{O}=15, \quad \mathbf{T}=20, \quad \mathbf{Y}=25$

Whenever you encounter any letter, locate its nearest EJOTY benchmark and step forward or backward by one or two positions:

• To index G: Benchmarked to $E(5) \rightarrow E + 2 = \mathbf{7}$.
• To index M: Benchmarked to $O(15) \rightarrow O - 2 = \mathbf{13}$ (or $J(10) + 3 = 13$).
• To index S: Benchmarked to $T(20) \rightarrow T - 1 = \mathbf{19}$.
• To index W: Benchmarked to $Y(25) \rightarrow Y - 2 = \mathbf{23}$ (or $T(20) + 3 = 23$).

Reverse Indexing and the Rule of 27

In reverse indexing, the alphabet runs backward: $Z=1, Y=2, \dots, A=26$. Reverse ciphers and mirror-pair substitutions frequently appear in selective scholarship batteries.

Rather than memorising a second set of 26 numbers, apply the Rule of 27:

$\text{Forward Position} + \text{Reverse Position} = 27$ $\text{Reverse Position} = 27 - \text{Forward Position}$

If a question asks for the reverse index of H ($H = 8$), compute $27 - 8 = \mathbf{19}$.

Complement Pairs (Mirror Substitution)

Complement pairs occur when letters equidistant from the start and end of the alphabet substitute for one another: the 1st letter ($A$) pairs with the 26th letter ($Z$), the 2nd ($B$) with the 25th ($Y$), and the 13th ($M$) with the 14th ($N$).

Because the sum of their forward indices is always 27, finding any mirror complement is immediate: find the letter whose position equals $27 - \text{target position}$.

---

Constant and Progressive Shift Rules (Caesar Ciphers)

Constant Shifts and Circular Wrapping

A constant shift applies a fixed numerical offset ($+k$ or $-k$) to every letter. When an addition exceeds 26 or a subtraction drops below 1, the alphabet wraps around circularly using modular arithmetic:

• Moving forward past Z: If you add $+3$ to $Y(25)$, calculate $25 + 3 = 28$. Wrap by subtracting 26: $28 - 26 = \mathbf{2}$, giving B.
• Moving backward past A: If you subtract $-3$ from $B(2)$, calculate $2 - 3 = -1$. Wrap by adding 26: $-1 + 26 = \mathbf{25}$, giving Y.

Progressive Shifts

In a progressive cipher, the shift value increments or decrements with each consecutive character position. For example, the first letter shifts by $+1$, the second by $+2$, the third by $+3$, and so forth.

Worked Example 1: Progressive Cipher

Problem: In a proprietary code, the word CRANE is encrypted as DTDRJ. Following the identical rule, how is the word SWORD encrypted?

Step 1: Determine the transformation vector. Compare the positions of CRANE and DTDRJ:

• $C(3) \rightarrow D(4)$: Shift is $+1$
• $R(18) \rightarrow T(20)$: Shift is $+2$
• $A(1) \rightarrow D(4)$: Shift is $+3$
• $N(14) \rightarrow R(18)$: Shift is $+4$
• $E(5) \rightarrow J(10)$: Shift is $+5$

The pattern is an arithmetic progression of shifts: $[+1, +2, +3, +4, +5]$.

Step 2: Apply the transformation to SWORD.

• Letter 1: $S(19) + 1 = 20 \rightarrow \mathbf{T}$
• Letter 2: $W(23) + 2 = 25 \rightarrow \mathbf{Y}$
• Letter 3: $O(15) + 3 = 18 \rightarrow \mathbf{R}$
• Letter 4: $R(18) + 4 = 22 \rightarrow \mathbf{V}$
• Letter 5: $D(4) + 5 = 9 \rightarrow \mathbf{I}$

The encoded word is TYRVI.

---

Interleaved Letter Codes

When a sequence does not yield a consistent progression from one character to the next, check for interleaved rules. In this structure, odd-numbered positions ($P_1, P_3, P_5$) operate under Rule A, while even-numbered positions ($P_2, P_4, P_6$) operate under Rule B.

Worked Example 2: Interleaved Sequence

Problem: If FALCON is encoded as IYOARL, what is the code for SILVER?

Step 1: Separate odd and even character streams. For FALCON $\rightarrow$ IYOARL:

• Odd positions ($1, 3, 5$):
  • $P_1: F(6) \rightarrow I(9)$: $+3$
  • $P_3: L(12) \rightarrow O(15)$: $+3$
  • $P_5: O(15) \rightarrow R(18)$: $+3$
  • Rule A (Odd positions) = $+3$.
• Even positions ($2, 4, 6$):
  • $P_2: A(1) \rightarrow Y(25)$: $-2$ (circular wrap: $1 - 2 = -1; -1 + 26 = 25$)
  • $P_4: C(3) \rightarrow A(1)$: $-2$
  • $P_6: N(14) \rightarrow L(12)$: $-2$
  • Rule B (Even positions) = $-2$.

Step 2: Apply the rules to SILVER.

• $P_1$ (Odd): $S(19) + 3 = 22 \rightarrow \mathbf{V}$
• $P_2$ (Even): $I(9) - 2 = 7 \rightarrow \mathbf{G}$
• $P_3$ (Odd): $L(12) + 3 = 15 \rightarrow \mathbf{O}$
• $P_4$ (Even): $V(22) - 2 = 20 \rightarrow \mathbf{T}$
• $P_5$ (Odd): $E(5) + 3 = 8 \rightarrow \mathbf{H}$
• $P_6$ (Even): $R(18) - 2 = 16 \rightarrow \mathbf{P}$

Interleaving the transformed characters yields VGOTHP.

---

Word-Code Mapping & Positional Deduction

A common reasoning-test format presents a list of four or five plain English words alongside four or five scrambled digit- or letter-based codes. Candidates are instructed to determine which code represents a specific target word.

The 3-Step Positional Frequency Technique

1. Scan Initial Characters: Count how many times each initial letter appears across the words, and compare this with the starting characters of the codes.
2. Scan Terminal Characters: Identify letters that appear only once in the final position or letters that repeat.
3. Isolate Unique Signatures: Match the unique positional profile of the target word directly to the codes.

Worked Example 3: Word-Code Matching

Problem: Four English words are paired with four numerical codes in random order:

• Words: COAT, TAIL, TOAD, LATE
• Codes: 4158, 8562, 8153, 2587

Which code represents the word COAT?

Step 1: Check initial letters versus initial digits.

• Words start with: C (1 word: COAT), T (2 words: TAIL, TOAD), L (1 word: LATE).
• Codes start with: 4 (1 code: 4158), 8 (2 codes: 8562, 8153), 2 (1 code: 2587).
• Deduction: Because two words begin with T and two codes begin with 8, the letter T must be represented by the digit 8 ($T = 8$).

Step 2: Check terminal letters.

• The target word is COAT. Its terminal letter is T.
• Since we established that $T = 8$, the code for COAT must end with the digit 8.
• Examining the final digits of the four codes:
  • 4158 ends in 8
  • 8562 ends in 2
  • 8153 ends in 3
  • 2587 ends in 7

Only a single code ends in 8: 4158.

Without solving for C, O, A, I, L, D or E, the answer is proven in seconds. (As a check, the full key is C = 4, O = 1, A = 5, T = 8, I = 6, L = 2, D = 3 and E = 7, giving TAIL = 8562, TOAD = 8153 and LATE = 2587.)

---

Memory Strategy: The Split-Alphabet Matrix

Edutest does not permit separate working out paper, so the best approach is to memorise this split-alphabet matrix until you can picture it instantly. If your supervisor allows writing in the question booklet, you can also jot it in a margin:

 1  2  3  4  5  6  7  8  9 10 11 12 13
 A  B  C  D  E  F  G  H  I  J  K  L  M
---------------------------------------
 Z  Y  X  W  V  U  T  S  R  Q  P  O  N
26 25 24 23 22 21 20 19 18 17 16 15 14

This single diagram delivers three massive advantages:

1. Instant Indices: Read the forward position of any letter instantly without counting.
2. Instant Reverse Indices: Read reverse numbers directly from the bottom row.
3. Instant Complement Pairs: Vertical columns immediately display mirror partners (e.g. $A \leftrightarrow Z, G \leftrightarrow T, M \leftrightarrow N$).