Originally Posted by axemansean
A good code breaker looks at certain key thing, Kasiski Method is used to see certain occurances of certain letter for example:
Suffixes: -th, -ing, -ed, -ion, -tion, …
Prefixes: Im-, Un-, In-,…
Infixes: -eek-, -oot-, -our-, -ss-, …
One reason German code was easy to break is because it was signed with the same last few words. Once you broke that you suddenly have a piece of the puzzle. Yes human key generation is better, but DES is still trusted by everyone. Also RSA is something a lot of people are looking at because RSA overcomes some of the problems of DES.
Ok I see your reasoning.
The common factor is the endings of words but put through a gauntlet of multiple keys the possibility of cracking this would be minimized.
lets say for instance you use the basic of basic keys...
A:
A-Z numbered 10-99
then you take the same in reverse
B:
Z-A numbered again 100-260, then you generate a random seriesof 4 digit numbers announcing
C:
A-Z lets say 1000-3000
Now you take letters from selection A and translate numerically and multiply by x.
The sum of this number makes for translation table B and each numeric value is multiplied by y.
The sum of that number is again multiplied by z and once that is done you could again have it divide back to the original key to get the final break on the code. This would make for virtually unlimited possibilities...couldn't it?