On the Subject of the GRANIT CM

Create a key using the keyword on screen 1 and the Boolean Expression on screen A. Make sure to remove any Xs. Create a straddling checkerboard by creating a table with 3 rows and 9 columns. Label the columns with the numbers 1-9. Cross out all the first-row cells in the columns whose labels are present in the 2 digit number on screen B . Label the 2nd row of the table with the left number on screen B. Label the 3rd row of the table with the right number on screen B. Fill the remaining 26 cells with the key in reading order. This will be referred to as the GRANIT Key.

Convert every letter of the encrypted word to digits via the GRANIT Key. Each letter that occurs in the first row gets turned into the single digit that labels its column; all other letters turn into digits labeling the row followed by the column.

Take the keyword from screen 2 and assign each letter in alphabetical order where 1 is a letter that occurs earliest from the alphabet. If there is a tie, assign each tie the SAME number. This will be referred to as the Myszkowski Key.

If the Submit Button is white, follow the instructions under Encrypt Instructions. Otherwise follow the instructions under Decrypt Instructions.

Encrypt Instructions

• Write the digit string underneath the Myszkowski Key so that it fits in the columns of the key in reading order.
• Read each digit in ascending numerical order. In the case of duplicate numbers, read them from left to right, top to bottom for the current duplicate number.

Decrypt Instructions

• Write X dashes underneath the Myszkowski Key so that it fits in the columns of the key in reading order. X is equal to the length of the digit string.
• Place each digit of the digit string in ascending numerical order, replacing each dash underneath the number. In the case of duplicate numbers, place them from left to right, top to bottom for the current duplicate number, until each of the dashes underneath the duplicate numbers have been replaced.
• Finally, read the digits in reading order to get a new digit string.

Convert the string of digits back into letters via the GRANIT Key. If the first digit is not present on screen B, use the corresponding letter from the first row. Otherwise, use a pair of digits, where the first identifies the row and the second the column, to obtain a letter.

Finally, if any of the letters on screen 3 match at the same position as any of the letters of your encrypted word, replace that letter with a X. You should now have an decrypted word.

Example 1

Encrypted Word: RDWIRF
Screen 2: GEOMETRY
Screen B: 12
Screen 3: LTCQUA
Using Encrypt Rules

	1	2	3	4	5	6	7	8	9
	-	-	A	B	C	D	E	F	G
1	H	J	K	L	P	Q	S	U	V
2	W	Y	Z	M	O	N	I	T	R

R → 29
D → 6
W → 21
I → 27
R → 29
F → 8

G	E	O	M	E	T	R	Y
2	1	4	3	1	6	5	7
2	9	6	2	1	2	7	2
9	8

2962127298 → 9182926722

9 → G
18 → U
29 → R
26 → N
7 → E
22 → Y

GURNEY + LTCQUA → GURNEY
Decrypted Word: GURNEY

Example 2

Encrypted Word: PNESAC
Screen 2: THRIVING
Screen B: 37
Screen 3: UNMJFV
Using Decrypt Rules

	1	2	3	4	5	6	7	8	9
	B	C	-	D	F	G	-	H	I
3	J	K	M	N	O	P	Q	S	U
7	V	W	Y	Z	R	E	L	A	T

P → 36
N → 34
E → 76
S → 38
A → 78
C → 2

T	H	R	I	V	I	N	G
6	2	5	3	7	3	4	1
-	-	-	-	-	-	-	-
-	-	-

T	H	R	I	V	I	N	G
6	2	5	3	7	3	4	1
7	6	3	4	2	7	6	3
8	3	8

36347638782 → 76342763838

76 → E
34 → N
2 → C
76 → E
38 → S
38 → S

ENCESS + UNMJFV → EXCESS
Decrypted Word: EXCESS