Development of mathematical models of systems of protection data on the basis of the multistage systems of diophantine equations
UDC
519.72+004DOI:
https://doi.org/10.31429/vestnik-16-3-6-15Abstract
The objective necessity of improvement of information security systems (SPI) in the conditions of development of information and telecommunication technologies is shown. Theorems which allow to describe the properties of parametric solutions of multistage systems of Diophantine equations necessary for the development of mathematical models of SPI on their basis are given. The theorem generalizing the known Frolov's theorem is presented, and the author's theorem on the basis of which the mathematical model of SPI containing Diophantine difficulties is developed is given.
A new approach to the development of SPI generalizing the principle of construction of public key cryptosystems is proposed. One part of the conditional identity is used for the direct transformation of the original message, and the other part - for the inverse transformation. A new concept of equivalence of ordered sets of numbers or parameters with a given dimension and degree is introduced.
Mathematical models of cryptosystems developed on the basis of two-parameter solutions of multistage systems of Diophantine equations, in particular, - equations of the fifth degree with the number of variables equal to twelve are presented. The described mathematical models demonstrate the potential of using Diophantine equations for the development of SPI with a high degree of reliability. These models allow to build asymmetric GIS, and the system public key. Such systems contain Diophantine difficulties admitting the existence of a countable set of equally probable keys.
Keywords:
information technologies, information security system, information encryption, symmetric cryptosystem, public key cryptosystem, multi-level system of Diophantine equations, Diophantine difficulties, Diophantine set, Diophantine representationAcknowledgement
References
- Shannon, C. Communication theory of secrecy systems. Bell System Techn. J., 1949, vol. 28, iss. 4, pp. 656–715. DOI: 10.1002/j.1538-7305.1949.tb00928.x
- Alpers, A., Tijdeman, R. The two-dimensional Prouhet–Tarry–Escott problem. J. of Number Theory, 2007, vol. 123. Iss. 2. P. 403–412. DOI: 10.1016/j.jnt.2006.07.001
- Matiyasevich, Yu.V. Desyataya problema Gil'berta [Hilbert's tenth problem]. Fiziko-matematicheskaya literatura, Moscow, 1993. (In Russian)
- Osipyan, V.O. Modelirovanie sistem zashchity informatsii soderzhashchikh diofantovy trudnosti. Razrabotka metodov resheniy mnogostepennykh sistem diofantovykh uravneniy. Razrabotka nestandartnykh ryukzachnykh kriptosistem [Modeling information security systems containing Diophantine difficulties. Development of methods for solving multi-degree systems of diophantine equations. Development of custom backpack cryptosystems]. LAMBERT Academic Publishing, Moscow, 2012. (In Russian)
- Osipyan, V.O. Matematicheskoe modelirovanie sistem zashchity dannykh na osnove diofantovykh uravneniy [Mathematical modeling of data protection systems based on diophantine equations]. Prikaspiyskiy zhurnal: upravlenie i vysokie tekhnologii [Pre-Caspian J.: Management and High Technologies], 2018, no. 1, pp. 151–160. (In Russian)
- Osipyan, V.O., Grigoryan, E.S. Metod parametrizatsii diofantovykh uravneniy i matematicheskoe modelirovanie sistem zashchity dannykh na ikh osnove [The method of parameterization of diophantine equations and mathematical modeling of data protection systems based on them]. Prikaspiyskiy zhurnal [Pre-Caspian J.], 2019, no. 1, pp. 164–172. (In Russian)
- Osipyan, V.O., Spirina, S.G., Arutyunyan, A.S., Podkolzin, V.V. Modelirovanie rantsevykh kriptosistem, soderzhashchikh diofantovuyu trudnost' [Modeling knapsack cryptosystems containing diophantine difficulty]. Chebyshevskiy sbornik [Chebyshevskii Sbornik], 2010, vol. 11, no. 1, pp. 209–216. (In Russian)
- Cassels, J.W.S. On a Diophantine Equation. Acta Arithmetica, 1960, vol. 6, iss. 1, pp. 47–52. DOI: 10.4064/aa-6-1-47-52
- Carmichael, R.D. The Theory of Numbers and Diophantine Analysis. New York, 1959.
- Chernick, J. Ideal solutions of the Tarry-Escott problem. Amer. Math. Monthly, 1937, vol. 44, iss. 10, pp. 626–633. DOI: 10.2307/2301481
- Dickson, L.E. History of the Theory of Numbers. New York, 1971.
- Dorwart H.L., Brown O.E. The Tarry-Escott problem. Amer. Math. Monthly, 1937, vol. 44, iss. 10, pp. 613–626. DOI: 10.2307/2301480
- Gloden, A. Mehgradige Gleichungen. Groningen, 1944, pp. 104.
- Alferov, A.P., Zubov, A.Yu., Kuz'min, A.S., Cheremushkin, A.V. Osnovy kriptografii [Cryptography Basics]. Gelios ARV, Moscow, 2002. (In Russian)
- Salomaa, A. Kriptografiya s otkrytym klyuchom [Public key cryptography]. Mir, Moscow, 1995. (In Russian)
- Shnayer, B. Prikladnaya kriptografiya: Protokoly, algoritmy, iskhodnye teksty na yazyke Si [Applied Cryptography: Protocols, Algorithms, C Source Texts]. Triumf, Moscow, 2002. (In Russian)
- Koblitz, N. A Course in Number Theory and Cryptography. Springer-Verlag, New York, 1987.
Downloads
Submitted
Published
How to Cite
Copyright (c) 2019 Osipyan V.O., Litvinov K.I., Zhuk A.S.
This work is licensed under a Creative Commons Attribution 4.0 International License.
