On the Subject of the Alphabetical Disorder CM
A machine that knows no bounds when it comes to ciphers.
The first letter of the encrypted word has already been decrypted. Decrypt the following letters using the instructions below:
- Subtract the alphabetic position (A1Z26) of the (N - 1)th decrypted letter by the alphabetic position (A1Z26) of the Nth encrypted letter.
- If the resulting number is below 1, add 26 until the number is between 1 - 26.
- Turn the number back into a letter to get your Nth decrypted letter (A1Z26).
Split the encrypted word into substrings using the numbers on screen 1 as the length of each substring. The remaining letters form a substring as well.
Reorder each substring in alphabet order, then put them back together to form a decrypted word.
Example
Encrypted Word: LVGOAJXH
Screen 1: 141
L - V → 12 - 22 → -10 + 26 → 16 → P
P - G → 16 - 7 → 9 → I
I - O → 9 - 15 → -6 + 26 → 20 → T
T - A → 20 - 1 → 19 → S
S - J → 19 - 10 → 9 → I
I - X → 9 - 24 → -15 + 26 → 11 → K
K - H → 11 - 8 → 3 → C
(L) (PITS) (I) (KC)
(L) (IPST) (I) (CK)
Decrypted Word: LIPSTICK