## On the Subject of the Dreamcipher CM

A machine that knows no bounds when it comes to ciphers.

From the Dreamcipher module by Kaito Sinclaire.

### Recreating the Glyph Alphabet

The table on page 3 is a glyph table. Some of the glyphs in the table have been mapped to a letter.

Start by creating a key using the keyword on screen 1 and the Boolean Expression on screen A. Convert the hexadecimal characters on screen 2 into binary.

Take the leftmost eight bits in the binary string and convert them to a decimal number, modulo 64. This is the number of the starting glyph, starting from zero in the top-left, proceeding in reading order.

Take the next four bits in the binary string, and convert them to a decimal number. Add one to that number, and advance that many additional glyphs, wrapping around to the top-left glyph if necessary. The resulting glyph maps to the 1st letter in the alphabet key.

Proceed likewise for the next four bits in the binary string, mapping the result to the next letter of the alphabet key.

Convert the 2 letters on screen B into Values via the Value Table, modulo 10, plus 1. The left value will be referred to as A and the right value will be referred to as B.

Do the following instructions down below until each letter of the alphabet key has been used:

- Let X be the previous bit string.
- Shift X left by A, XOR that with X, and save the result as X.
- Shift X right by B, XOR that with X, and save the result as X.
- All shifts are logical shifts—always shift in zeroes.