The article describes a new implementation of MST3 cryptosystems based on the automorphism group of the field of the Hermitian function. The main difference in the presented implementation is the presence of two-stage recovery of parts of the message from the encrypted text. The presented implementation of a cryptosystem has a greater reliability. The complexity of the cryptanalysis and the size of the message for encryption in the square root is greater than that of the MST3 cryptosystem on the Suzuki group.

Internet of things (IoT) is a growing technology with a big market and impact to our lives. It can ease various different tasks for us. Meanwhile, IoT has many serious security threats, like data breaches, side-channel attacks, and virus and data authentication. Our present classical cryptography, like the Rivest-Shamir-Adleman (RSA) algorithm, work well under the classical computers. However, the technology is slowly shifting towards quantum computing, which has immense processing power and is more than enough to break the current cryptographic primitives in affordable time. So, it is required to design quantum cryptographic algorithms to prevent our systems from security breaches even before quantum computers will be available for commercial purposes on the market. In this paper, we describe a new implementation of MST3 cryptosystems based on the group of automorphisms of the field of the Pu function. The main difference of the presented implementation is the extension of the logarithmic signature and, as a consequence, the presence of multi-stage recovery of message parts from the ciphertext. The presented implementation of the cryptosystem is more reliable. The cryptanalysis complexity and message size for encryption are square times larger than the MST3 cryptosystem in the Suzuki group. This approach shows advantages and it is a quantum safe for the IoT use.

This article describes a new implementation of MST-based encryption for generalized Suzuki 2-groups. The well-known MST cryptosystem based on Suzuki groups is built on a logarithmic signature at the center of the group, resulting in a large array of logarithmic signatures. An encryption scheme based on multiparameter non-commutative groups is proposed. The multiparameter generalized 2 - Suzuki group was chosen as one of the group constructions. In this case, a logarithmic signature is established for the entire group. The main difference from the known one is the use of homomorphic encryption to construct coverings of logarithmic signatures for all group parameters. This design improves a secrecy of the cryptosystem is ensured at the level of a brute-force attack.

У статті розглянуто сучасні світові тренди розвитку фінансових технологій в умовах поступу цифрової економіки. Проаналізовано чистий дохід від фінтех-компаній за регіонами, зокрема за рівнем розвитку економік країн світу. Наведено прогнозні показники щодо обсягів транзакцій та кількості користувачів фінтех-ринку за сегментами у світі до 2028 року. В роботі розглянуто актуальні сегменти розвитку фінтех-індустрії протягом наступних п'яти років у світі та в Україні. Детально проаналізовано сучасний стан розвитку фінтех-ринку в нашій державі, а саме: особливості здійснення платіжних послуг і банківської діяльності у контексті прийняття ЗУ «Про платіжні послуги» та намірів запровадження відкритого банкінгу; перспективи створення Національним банком України е-гривні; виклики щодо забезпечення кібербезпеки фінансового сектору тощо. За результатами проведеного дослідження визначено переваги та недоліки фінтех-рішень і продуктів.

The main efficiency indicators of cryptographic Boolean functions and vector mappings, which are used as nodes of the complexity in symmetric cryptographic transformations, are substantiated. Methods of heuristic generation of cryptographic Boolean functions and nonlinear S-boxes for symmetric ciphers that meet the established security requirements are investigated. Prospects for further research with the aim of improving heuristic methods for the synthesis of random S-boxes are substantiated.