RASCAL

This program will accept either plain-text or encrypted data and perform the reverse operation on it. You are asked for data input, and two key values - the result is the encryption or decryption of that data.

• All keys are hashed.
• The message is compressed, and then padded to a multiple of 180 characters to hide actial length.
• A rotating substitution array is applied to the message to expand its dynamic range.
• The entire message is shuffled on two levels (bit and byte).
• The data is encrypted non-sequentially making stream-analysis worthless.

This will encrypt 100,000 bytes of UTF-8 data in a reasonable time. It will accept two keys of any length, but 4,000 bytes for each key is a practical limit for internal reasons.

The actual depth of encryption is directly related to the length of the key you use. A one character key is 6-bit encryption, a 10 character key is 65-bit encryption, a 100 character key is 650-bit encryption, etc. If you use keys longer than 100 characters with this little example, there are no known approaches to break it except brute-force, or finding a flaw in the algorithm.

Again, what makes this work is to use different keys for every message and apply them in other than front-to-back manner, and keep the messages smaller than 100,000 characters. Brute force is the only way to break it that I know of, and at a large key depth that is not possible in your lifetime. The "intelligence" is contained within the keys, and not the code! The code just interprets and reacts to the information contained within the keys. That is why I can show you my code and it doesn't help you in breaking the encryption.

Consult the tutorial to get a description of the ideas used in the code.