Using Cycles of Attractors of Tent Mapping to Encode a Message.

The aim of the work is: Using Cycles of Attractors of Tent Mapping to Encode a Message. To achieve this goal, the work was divided into several parts: the study of the necessary material in cryptology; research of mathematical properties of cycles of triangular attractors; the development of an encryption algorithm based on the material studied; implementation of the developed algorithm. So, in the course of the work, the mathematical article of V. Chetverikov on the topic of tent mapping attractors and many articles and books on cryptography and cryptanalysis of many authors such as: E.G. Pluzhnik, V.N. Shashikhin, V.V. Yaschenko, V.A. Romanov, H.K.F. Van Tilborg, etc. After studying the presented material, an algorithm was developed and programs were written using the software tools of the Python programming language and Wolfram Mathematica for its implementation. As a result, we received a new efficient text encryption algorithm based on pseudo-random numbers. The algorithm allows you to encrypt text without using the same characters to encode repeated elements of the alphabet. This fact eliminates the possibility of using frequency analysis when trying to decrypt without knowing the key.