Hence the reasoning for a modified Ceaser which would change the variables exponentially.

A ceasers box works off the idea that everything works off a specific numeric designation or order. If you were to jumble the order in a seemingly random manner then it could keep an outside source without the key guessing for months, by the time they firgure it out the content is obsolete.

Things only have to stay classified for a certain period of time then they are disposable, but if you can create a relatively simplistic version of a complicated variable the possibilities are endless.

 

You can have the public key, what about the private key? And the key being of variable length and constantly changed it is hard to break.

 

Caesar is very weak, it is still a mathematical procedure that can be backworked. But, with the use of public and private keys you ensure that the keys are kept secret.

 

Now you are talking digital Fortress type stuff.

Yes that is a possibility and doable but I am looking to do this manually not digitally.

Therefore basically the decryption key would be on a sliding scale though the only actual key would exist within several different documents and no two documents would translate under the same key.

If you used an alphanumeric key to encode, then have it translated again into another alphanumeric code, then follow that with the final translation using three different keys which are on a rotating scale the possibilities would be something like 500 uniquely keyed messages from one single key set.

 

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.

 

http://www.distributed.net/

RC5-72bit is on now :rockon:

 

Used a polyalphabetic ciphers, it will CONFUSE even the best code breaker. A distribution table will be completely flat and they can't use any known tables to break it.

For instance:

I want to encode this.

I - 2
W - 1
A - 1
N - 2
T - 2
O - 2
E - 2
C - 1
D - 1
H - 1
S - 1

A good polyalphabetic analysis would ensure that table would have the same frequency for each letter. Breaking that would be next to impossible without the help of advanced math and a good program.

 

this thread is interesting I can only dream of understanding what you guys are talking about but this "cryptography" interests me if its breaking enemy codes and the like that shiet is badass :bigok:

 

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?

 

When you buy something on line, your credit card info is encoded and sent to the company. Most companies use DES which is the current standard, what most of you don't realize is programs like Kazaa and Napster, etc have small programs running to break DES. That is cryptography, it is the art of hiding a message from anyone but its intended audience.