Kerchoff's principle states that in a cryptosystem, the encryption algorithm should be exposed to everyone and the key should be kept secret. It is reasonable to stick to this principle because we have a limited number of hard-to-break cryptographic algorithms and we can generate a huge number of random keys and select one of them on demand. But what if we have a large repository of perfectly-secure cryptographic algorithms each of which represented by a unique numerical code. Now we will not need a key anymore and we can depend on keeping the algorithm confidential. PSKC is a perfectly-secure keyless cryptosystem which aims at bringing the notion of perfect secrecy into operation and removing the notion of the key from the cryptosystem. PSKC will consist of frameworks for enumerating and encoding perfectly-secure algorithms, generating and exchanging random algorithm codes and implementing the algorithm represented by a given numeric. We will show that PSKC will make the cryptosystems harder-to-break by using perfectly-secure algorithms as well making the search space larger for the third party. Furthermore, PSKC will blur the border between symmetric and asymmetric cryptographic. PSKC frameworks will also make it possible to apply KDD mechanisms to numeric codes representing algorithms.
I have received my B.Sc. and M.Sc. degrees in computer engineering from Iran University of Science and Technology. I am to be graduated from Ph.D. by the end of this November in the worst case. My previous research experiences span the following areas based on which support my main interest in cryptography. • Parallel and High performance Computing • Memory Systems • Network and Information Security • Information theory and Coding and • Group Theory and Discrete Mathematics • Complex Systems and Complex Networks • Chaos Theory