论文信息 - An unbreakable cryptosystem

An unbreakable cryptosystem

The remarkably long-standing problem of cryptography is to generate completely secure key. It is widely believed that the task cannot be achieved within classical cryptography. However, there is no proof in support of this belief. We present an incredibly simple classical cryptosystem which can generate completely secure key.

Arindam Mitra | Arindam Mitra

[1] Arindam Mitra. Human being is a living random number generator , 2005 .

[2] Arindam Mitra,et al. Quantum mechanics can alone provide security in communication , 2005, ArXiv.

[3] Arindam Mitra. An unbreakable cryptosystem for common people , 2006, ArXiv.

[4] Arindam Mitra. Quantum mechanics can make us honest , 2005 .

[5] Arindam Mitra,et al. Quantum communication is possible with pure state , 2006, cs/0610102.

[6] Arindam Mitra. True random bits can be generated by algorithmic process , 2005 .

[7] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[8] Henry Beker,et al. Cipher Systems: The Protection of Communications , 1982 .

[9] Stephen Wiesner,et al. Conjugate coding , 1983, SIGA.

[10] N. Koblitz. A Course in Number Theory and Cryptography , 1987 .

[11] D. Kahn. The codebreakers : the story of secret writing , 1968 .