Artificial intelligence

Abstract: The article proposes a cryptosystem with symmetric keys, where the keys are functions of a real variable. These functions can be either continuous or discrete and must satisfy certain constraints. The number of key functions is determined by the number of binary digits that encode a character in the ASCII table. Each binary digit has its own key function. The cipher of a character is represented by a one-dimensional array of real numbers. These numbers are obtained by summing the key functions, which correspond to “1” in the ASCII code of the character. The amplitudes of these functions are random and unknown to the receiving party. Decryption is a multi-level process, in which integral disproportion functions are calculated at each level. To increase the cryptographic strength, the encryption/decryption process involves a permutation of the key-functions according to a secret scheme agreed upon by both parties. Computer simulation has demonstrated the high cryptographic resistance of the proposed system to the determination of the coefficients within the key functions, as well as to the rearrangement of the key functions themselves. It is shown that adjacent identical symbols in an encrypted message have different ciphers, which also complicates hacking the system.

Keywords: cryptosystems, disproportion functions, functions of real variables, key functions, encryption, decryption, text messages

References:

1. FIPS. (2001). Specification for the ADVANCED ENCRYPTION STANDARD (AES). In Federal Information Processing Standards Publication. https://nvlpubs.nist.gov/nistpubs/fips/nist.fips.197.pdf
2. Courtois, N. T. (2012). Security Evaluation of GOST 28147-89 in View of International Standardisation. In Cryptologia (Vol. 36, Issue 1). https://doi.org/10.1080/01611194.2011.632807
3. Rivest, R. L., Shamir, A., Adleman, L. (1978). A Method for Obtaining Digital Signatures and PublicKey Cryptosystems. Communications of the ACM, 21(2). https://doi.org/10.1145/359340.359342
4. Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., O’Brien, J. L. (2010). Quantum computers. Nature, 464(7285), 45–53. https://doi.org/10.1038/nature08812
5. Ostrianska, Y. V., Yesina, M. V., Gorbenko, I. D. (2022). Analysis of views of the European Union on quantum-post-quantum limitations. Radiotekhnika, 210. https://doi.org/10.30837/rt.2022.3.210.06
6. Grover, L. K. (1997). Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters, 79(2). https://doi.org/10.1103/PhysRevLett.79.325
7. Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5). https://doi.org/10.1137/S0097539795293172
8. Proos, J., Zalka, C. (2003). Shor’s discrete logarithm quantum algorithm for elliptic curves. Quantum Information and Computation, 3(4). https://doi.org/10.26421/qic3.4-3
9. Bagaria, J. (2010). Set theory. In The Princeton Companion to Mathematics. https://doi.org/10.4324/9781315167749-28
10. Avramenko, V. V., Zabolotnyy, M. I. (2009). Sposib shyfruvannya danykh (Pat. 42957 U Ukrayina, MPK6 H 04 L 9/00.). Derzhavne pidpryyemstvo “Ukrayins'kyy instytut promyslovoyi vlasnosti” (UKRPATENT). https://essuir.sumdu.edu.ua/bitstreamdownload/123456789/9879/1/getdocument.pdf
11. Kalashnikov, V. V., Avramenko, V. V., Kalashnykova, N. I., Kalashnikov, V. V. (2017). A Cryptosystem Based Upon Sums of Key Functions. International Journal of Combinatorial Optimization Problems and Informatics, 8(1), 31–38. https://ijcopi.org/ojs/article/view/5
12. Kalashnykova, N., Avramenko, V., Kalashnikov, V. (2019). Sums of Key Functions Generating Cryptosystems (pp. 293–302). https://doi.org/10.1007/978-3-030-22750-0_23
13. Avramenko, V., Demianenko, V. (2020). Cryptosystem based on a key function of a real variable. CEUR Workshop Proceedings, 2608. https://doi.org/10.46932/sfjdv2n2-113
14. Hryshchuk, R., Hryshchuk, O. (2019). A GENERALIZED MODEL OF FREDHOLM’S CRYPTOSYSTEM. Cybersecurity: Education Science Technique, 4, 14–23. https://doi.org/10.28925/2663- 4023.2019.4.1423
15. Avramenko, V., Bondarenko, M. (2021). Using the Sum of Real Type Functions to Encrypt Messages. CEUR Workshop Proceedings, 3200.
16. Avramenko, V. V. (2000). Harakteristiki neproporcional'nosti chislovyh funkcij i ih primenenie pri reshenii zadach diagnostiki. Visnyk Sums’koho Derzhavnoho Universytetu, 16, 12–20. https://essuir.sumdu.edu.ua/bitstreamdownload/123456789/1824/1/5201C993d01.pdf
17. Avramenko, V. V., Kalashnykova, N. I., Kalashnikov, V. V., Watada, J. (2023). Derivative of disproportion functions for pattern recognition. In Unconventional Methods for Geoscience, Shale Gas and Petroleum in the 21st Century. https://doi.org/10.3233/AERD230022
18. Kalashnikov, V. V., Avramenko, V. V., Slipushko, N. Y., Kalashnykova, N. I., Konoplyanchenko, A. E. (2017). Identification of Quasi-Stationary Dynamic Objects with the Use of Derivative Disproportion Functions. Procedia Computer Science, 108. https://doi.org/10.1016/j.procs.2017.05.266
19. Avramenko, V., Moskalenko, A. (2019). Operative recognition of standard signals in the presence of interference with unknown characteristics. CEUR Workshop Proceedings, 2353. https://doi.org/10.32782/cmis/2353-5
20. Karpenko, A. P. (2000). Integral’nye kharakteristiki neproportsional’nosti chislovykh funktsii i ikh primenenie v diagnostike. Visnyk Sums’koho Derzhavnoho Universytetu, 16, 20–25. https://essuir.sumdu.edu.ua/bitstream-download/123456789/10931/1/4_Karpenko.pdf