Modified one-time pad

Автор: Maksim Iavich, Zura Kevanishvili
Организация: Caucasus University, European School


Ключевые слова: modification, one-time pad, OTP
Аннотация. Theoretically, quantum computers will be able to solve quickly the problems that classical computers would solve for thousands of years. This technology can change our world. A typical user will not need a quantum computer for a long time, maybe never. But using quantum computer it is possible to break all existing crypto systems. American mathematician Peter Shore invented a quantum algorithm that can factorize a large number into two simple factors very quickly. Unfortunately, classical computers make it very slowly. Classical computers can do it by sorting out all the combinations, but it will take million years. Safety of modern cryptographic algorithms is based on this weakness of classical computers, for example RSA. RSA BSAFE encryption technology is used approximately by five hundred million users in the world. RSA BSAFE is a validated cryptography library offered by RSA scheme. As we can wee RSA is the mostly used crypto system and it can be considered one of the most common public key cryptosystems that is developing together with development of Internet. Breaking RSA is a global problem and it can lead to breaking almost all the products in the world One Time Pad (OTP) cipher is an example of a system with absolute cryptographic stability, this is system with perfect secrecy. It is considered one of the simplest cryptosystems. The biggest problem of one-time pad cypher is that it has one-time key. If the key is used to encrypt more than one message, the cypher is not secure. In the article is offered the new modified variation of OTP, that is safe against quantum computer attacks


Gagnidze A.G., Iavich M.P., Iashvili G.U., Analysis of Post Quantum Cryptography use in Practice, Bulletin of the Georgian National Academy of Sciences, vol. 11, no. 2, 2017, p.29-36
Avtandil Gagnidze & Maksim Iavich & Giorgi Iashvili, 2017. “Some Aspects Of Post-Quantum Cryptosystems,” Eurasian Journal of Business and Management, Eurasian Publications, vol. 5(1), pages 16-20
Bernstein D.J. (2009) Introduction to post-quantum cryptography. In: Bernstein D.J., Buchmann J., Dahmen E. (eds) Post-Quantum Cryptography. Springer, Berlin, Heidelberg
Bennett, Charles H., et al. “Quantum Cryptography.” Scientific American, vol. 267, no. 4, 1992, pp. 50–57. JSTOR, JSTOR,
Gu, B., Zhang, C., Cheng, G. et al. Sci. China Phys. Mech. Astron. (2011) 54: 942.
Kocher P.C. (1996) Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. In: Koblitz N. (eds) Advances in Cryptology — CRYPTO ’96. CRYPTO 1996. Lecture Notes in Computer Science, vol 1109. Springer, Berlin, Heidelberg
Boneh D. (1998) The Decision Diffie-Hellman problem. In: Buhler J.P. (eds) Algorithmic Number Theory. ANTS 1998. Lecture Notes in Computer Science, vol 1423. Springer, Berlin, Heidelberg
Dominic Mayers, Quantum Key Distribution and String Oblivious Transfer in Noisy Channels, Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology, p.343-357, August 18-22, 1996