Автор: Andria Kelekhsaevi, Gega Shavdatuashvil, Giorgi Meliqidze, Giorgi Mchedlidze
Организация: Cervantes Gymnasium-gess, , 176 pubic school, school Opiza


Ключевые слова: Collatz Conjecture, Cryptography, Collatz problem, irreversible hash, Encryption
Аннотация. This article distinguishes Usage of Collatz Conjecture in cryptography. In particular, how we can hash information using the “3n+1” algorithm. We review a new method of irreversible hash and its usage in the modern world using,“3x+1” problem.


1. L. Colussi, “The convergence classes of Collatz function,” Theoretical Computer Science, vol. 412, no. 39, pp. 5409–5419, 2011.
2. P. C. Hew, “Working in binary protects the repetends of 1/3h: Comment on Colussi’s ’The convergence classes of Collatz function’,” Theoretical Computer Science, vol. 618, pp. 135–141, 2016.
3. R. K. Guy, “Don’t try to solve these problems,” Computers and Mathematics with Applications, vol. 90, no. 1, pp. 35–41, 1983.
4. G. T. Leavens and M. Vermeulen, “ search programs,” Computers & Mathematics with Applications. An International Journal, vol. 24, no. 11, pp. 79–99, 1992.
5. R. E. Crandall, “On the "3x+1'' problem,” Mathematics of Computation, vol. 32, no. 144, pp. 1281–1292, 1978.
6. W. Ren, S. Li, R. Xiao, and W. Bi, “Collatz Conjecture for 2100000-1 is true - algorithms for verifying extremely large numbers,” in Proceedings of the IEEE UIC 2018, pp. 411–416, Guangzhou, China, October 2018.
7. I. Krasikov and J. C. Lagarias, “Bounds for the problem using difference inequalities,” ActaArithmetica, vol. 109, no. 3, pp. 237–258, 2003. View at: Publisher Site | Google Scholar | MathSciNet
8. Gagnidze, M. Iavich, G. Iashvili, Some Aspects of Post-Quantum Cryptosystems, Abstract book, EURO-ASIA FORUM IN POLITICS ECONOMICS AND BUSINESS – 2016, JULY 21-22, 2016, BELGRADE, SERBIA.