Control Systems and Computers, N2, 2022, Article 2
https://doi.org/10.15407/csc.2022.02.011
Control Systems and Computers, 2022, Issue 2 (298), pp. 11-20
UDC 516.813
Sergii L. Kryvyi, Doctor of Physical and Mathematical Sciences, Professor, Department of Intelligent Software Systems, faculty of Computer Science and Cybernetics, Kyiv National Taras Shevchenko University, Akademika Hlushkova Ave 4D, Kyiv, Ukraine, ORCID: http://orcid.org/0000-0003-4231-0691,
E-mail: sl.krivoi@gmail.com,
Yuliia Nortman, M.S. in Software Engineering, Kyiv National Taras Shevchenko University, Akademika Hlushkova Ave 4D, Kyiv, Ukraine, ynortman@gmail.com
A Protocol for Exchange Information on the Base of
Linear Functions and Operators
Introduction.Safety of human activity is required for almost every enterpriseinstitution, organization, bank, etc. Therefore, it is extremely important to have a possibility to transform the information in such a way that it becomes inaccessible to the malicious user.
Purpose. The purpose of this article is to describe a protocol, based on linear function and operators properties, that allows to transmit the data in fast and secure way between two subscribers – sender and receiver.
Methods. The simple message exchange protocol is based on the properties of operators in linear space and the complexity of algorithms for solving systems of linear homogeneous Diophantine equations in the set of natural numbers.
Results. An application to transmit a message from sender to receiver in a secure way was developed.
Conclusion.The complexity of developed algorithm belongs to polynomial class and complexity of decryption belongs to Exptime (#NP).
Download full text! (On Ukrainian)
- Hermann, M., Juban, L., Kolaitis, P.G., 1999. “Оn the Complexity of Counting the Hilbert Basis of Linear Diophantine System”. Springer Verlag. NCS. No. 1705, pp. 13-32.
https://doi.org/10.1007/3-540-48242-3_2 - Kryvyi, S.L., 2021. Liniini diofantovi obmezhennia ta yikh zastosuvannia. К.: Interservis. 60 p. (In Ukrainian).
- Cormen, T., Leiserson, Ch., Rivest, R., Stein, C., 2005. Introduction to Algorithms (3d edition). 1290 p. (In Russian).
- Ryabko, B.Ya., Fionov, A.N., 2005. Kriptograficheskie metodyi zaschity iinformatsii. M: Goryachaya liniya – Telekom. 229 p. (In Russian).
- Diffie, W., Hellman, M.E., 1976. “New direction in cryptography”. IEEE Transaction on Infor-mation Theory, v. 22, pp. 644-654. https://doi.org/10.1109/TIT.1976.1055638
- Berczes, A., Lajos, H., Hirete-Kohno, N., Kovacs, T., 2014. “A key exchange protocol based on Diophantine equations and S-integers”. In JSIAM Letters. pp. 85-88.
https://doi.org/10.14495/jsiaml.6.85 - Kameswari, P.A., Sriniasarao, S.S., Belay, A., 2021. “An Application of Linear Diophantine equations to Cryptography”. Advanced in Mathematics: Scientific Journal, v. 10. N 6, pp. 2799-2806.
https://doi.org/10.37418/amsj.10.6.8 - Kurosh, A., 2008. Kurs vyisshey algebryi. 432 p. (In Russian).
- AMQP Advanced Message Queuing Protocol Protocol Specification. 0-9-1. 2008. https://www.rabbitmq.com/resources/specs/amqp0-9-1.pdf.
- Videla A., Williams, J., 2012. RabbitMQ in Action. Shelter Island: Manning Publications Co., 288 p.
Received 01.02.2022
