On the Subject of Homophonic CM
A machine that knows no bounds when it comes to ciphers.
Config the table below so that the lowest value in that row is underneath the letter that is shown on screen A. Ex: OEC means that 01 is under O, 27 is under E, and 53 is under C.
For each letter of the encrypted word, do the following.
- Calculate the absolute difference of the alphabetic positions between the Nth letter of the encrypted word and the Nth letter of the string on screen 1.
- Calculate the absolute difference of the alphabetic positions between the Nth letter of the encrypted word and the Nth letter of the string on screen 2.
- Treat the 1st number you got as the tens place and the 2nd number as the ones place.
- Find the number in the table you configured to decrypt to a letter that is above the row of numbers.
You should now have a decrypted word.
Example
Encrypted Word: DBMVKAY
Key: HRS
Screen 1: JGOOKAU
Screen 2: LBFSCHY
|D - J| * 10 + |D - L| → 68 → H
|B - G| * 10 + |B - B| → 50 → O
|M - O| * 10 + |M - F| → 27 → R
|V - O| * 10 + |V - S| → 73 → M
|K - K| * 10 + |K - C| → 08 → O
|A - A| * 10 + |A - H| → 07 → N
|Y - U| * 10 + |Y - Y| → 40 → E
Decrypted Word: HORMONE