CODING

Motivation

”Aha, still another symmetric coding system, how boring!”
That isn’t quite correct!

Both encoding and decoding reaches data throughput results of 2-digit megabytes per second.
There are no trapdoor-functions, i.e. the CODING-algorithm is absolutely ”clean”! The guarantee to this we will give you in writing with this! Nobody neither our company nor other powerful organizations has the possibility in any manner to deduce a non trivial key without checking all possible keys.
With CODING you can use a special method to enter a key, the so-called ”overloading” (also called ”overlay”).
You know that: You are advised to use a key as complex as possible and you also have to change the key every 3 months please! But why you have to adapt the technique? Why the technique cannot adapt to you, why you don’t have the possibility to use handy and therefore easy to remember keys?

You are completely right! We handle that for you !

How to do it? Very easy:
You do not enter only an ordinary key but you also enter a name of a dataset, which content is used to ”modify” the key.
But hasn’t a ”villain” the possibility to reproduce this and to consider this by trying to decode?
Yes and no! Up to 2 gigabytes of an overloading dataset can be used to modify the initial key. Doing so not all information of the overloading dataset is selected and used. Rather this will be controlled by additional parameters and the respective key value at the referring point. Because of that the ”villain” has no other possibility than to modify every key, used to decode, by overloading dataset information once again even if he/she knows the additional parameters!
This action to detect an even simple key reduces the number of decoding tests per time unit in a deciding way, so the disclosure effort of your simple key in conjunction with an overloading dataset beats the disclosure effort of a complex key without overloading dataset by far!
If however the overloading dataset and the additional parameters are unknown, your real key is generated by your ”simple” key duplicated to fill 256 bytes and then this intermediate key is ”coincidentally” overwritten at single or multiple places by overloading dataset information. Therefore your real key is an unsystematic key of 256 bytes, so the ”villain” has to prove all such keys !
You see, the remembering of complex passwords (which you can’t remember, therefore you write them down anyway, what’s wrong on the other hand) is brought to an end. Don’t remember complex rules, the right place for your password is your brain so you can remember it in a simple way!

CODING
Program for en- / decoding on place

back to the top