Post by mortlach on Jul 12, 2018 21:58:05 GMT
Red Runes Key Search
It is often asked what methods have been tried to decrypt the runes. There isn't much information on actual failed attempts out there, and there are many good reasons why this is the case. Here is some attempt to rectify this by sharing some code that will generate keys for many different cribs of the red runes.
github: Key Search
Its written in fairly basic python, so hopefully should be reasonably understandable. Encryption and decryption methods for simple arithmetic functions and a recursive method (and here) have been coded. The cipher text of the LP has been used with cribs from the n-gram data-base to generate the keys required for each method to give the cipher-text. To help with identifying patterns the keys are also shifted so their first element is zero. All the data: crib, cipher-text, shift, encryption method, keys and 'keys shifted to zero' are output to files for further inspection.
The scripts generate many thousands of keys. Maybe amongst all these keys is one with a simple pattern that can be extended.
Key Patterns
A next stage could be to set up a pattern matching object that can sort through the key-data and find interesting looking keys.
For example:
Prime Sequence Keys: here are the keys that are consistent with a 'shifted' prime sequence. There are 491 of them. Most, but not all, are keys that contain wild-card characters.
Fibonacci Sequence Keys: (285 of them)
It is often asked what methods have been tried to decrypt the runes. There isn't much information on actual failed attempts out there, and there are many good reasons why this is the case. Here is some attempt to rectify this by sharing some code that will generate keys for many different cribs of the red runes.
github: Key Search
Its written in fairly basic python, so hopefully should be reasonably understandable. Encryption and decryption methods for simple arithmetic functions and a recursive method (and here) have been coded. The cipher text of the LP has been used with cribs from the n-gram data-base to generate the keys required for each method to give the cipher-text. To help with identifying patterns the keys are also shifted so their first element is zero. All the data: crib, cipher-text, shift, encryption method, keys and 'keys shifted to zero' are output to files for further inspection.
The scripts generate many thousands of keys. Maybe amongst all these keys is one with a simple pattern that can be extended.
Key Patterns
A next stage could be to set up a pattern matching object that can sort through the key-data and find interesting looking keys.
For example:
Prime Sequence Keys: here are the keys that are consistent with a 'shifted' prime sequence. There are 491 of them. Most, but not all, are keys that contain wild-card characters.
Fibonacci Sequence Keys: (285 of them)