The idea of a simple substitution code
Simple substitution ciphers substitute one letter of the alphabet for another, in some random arrangement. Here is an example of a simple substitution cipher:
| A | → | D |
| B | → | V |
| C | → | N |
| D | → | X |
| E | → | I |
| F | → | K |
| G | → | S |
| H | → | W |
| I | → | Y |
| J | → | Z |
| K | → | T |
| L | → | Q |
| M | → | M |
| N | → | H |
| O | → | P |
| P | → | A |
| Q | → | U |
| R | → | F |
| S | → | L |
| T | → | G |
| U | → | E |
| V | → | O |
| W | → | B |
| X | → | C |
| Y | → | R |
| Z | J |
To use this substitution cipher table to write a coded message, substitute each letter in the original message with the substitute letter from the table. For example, the message: [Read more…]
