Research of collision properties of the modified UMAC algorithm on crypto-code constructions

The transfer of information by telecommunication channels is accompanied by message hashing to control the integrity of the data and confirm the authenticity of the data. When using a reliable hash function, it is computationally difficult to create a fake message with a pre-existing hash code, however, due to the weaknesses of specific hashing algorithms, this threat can be feasible. To increase the level of cryptographic strength of transmitted messages over telecommunication channels, there are ways to create hash codes, which, according to practical research, are imperfect in terms of the speed of their formation and the degree of cryptographic strength. The collisional properties of hashing functions formed using the modified UMAC algorithm using the methodology for assessing the universality and strict universality of hash codes are investigated. Based on the results of the research, an assessment of the impact of the proposed modifications at the last stage of the generation of authentication codes on the provision of universal hashing properties was presented. The analysis of the advantages and disadvantages that accompany the formation of the hash code by the previously known methods is carried out. The scheme of cascading generation of data integrity and authenticity control codes using the UMAC algorithm on crypto-code constructions has been improved. Schemes of algorithms for checking hash codes were developed to meet the requirements of universality and strict universality. The calculation and analysis of collision search in the set of generated hash codes was carried out according to the requirements of a universal and strictly universal class for creating hash codes

Development of a protocol for a closed mobile internet channel based on post-quantum algorithms

The development of computing technologies has made it possible not only to expand the range of mobile communication services, but also to significantly increase computing capabilities. The emergence of mobile Internet, 4G, 5G technologies makes it possible to talk about a fundamentally different approach to ensuring the quality of service to network customers, creating fundamentally new approaches to ensuring the efficiency and reliability of transmitted information flows. However, such a rapid growth of GSM technologies without the introduction of security services leads to active actions of attackers and cyber terrorists, the emergence of new and modification of known threats. Mobile communication channels are used by cybercriminals for selfish purposes of access to database resources not only of the mobile Internet, but also to the databases of information and communication systems and networks. The article proposes a fundamentally new approach to ensuring the closure of the voice channel of the mobile Internet based on post-quantum cryptography algorithms – McEliece and Niederreiter crypto-code constructions on elliptic codes. This approach provides not only the offline mode of closing the voice channel and creating a VPN channel in tunnel mode, but also the required level of cryptographic strength in the face of the emergence of full-scale quantum computers.

A SURVEY OF MODERN TECHNIQUES OF ERROR CORRECTION CODING

Рассмотрены методы помехоустойчивого кодирования, применяемые в современных системах передачи и хране -ния информации. Представлен краткий обзор кодовых конструкций, алгоритмов декодирования, достигаемыххарактеристик помехоустойчивости и производительности. Указаны основные достоинства и недостатки применяемых подходов, а также некоторые направления их развития. The paper discusses error correction coding techniques used in modern communication and storage systems. A brief survey of code constructions, decoding algorithms, and achievable performance and complexity is presented. The principal advantages and drawbacks of the considered techniques, as well as some further research directions, are outlined.

The Decoding Algorithms For Error-Correcting Product Codes Based On Project Geometry Low-Density Parity-Check Codes

The focus of this paper is directed towards the investigation of the characteristics of symbol-by-symbol iterative decoding algorithms for error-correcting block product-codes (block turbo-codes) which enable to reliable information transfer at relatively low received signal/noise and provide high power efficiency. Specific feature of investigated product codes is construction with usage of low-density parity-check codes (LDPC) and these code constructions are in the class of LDPC too. According to this fact the considered code constructions have symbol-by-symbol decoding algorithms developed for total class LDPC codes, namely BP (belief propagation) and its modification MIN_SUM_BP. The BP decoding algorithm is iterative and for implementation the signal/noise is required, for implementation of MIN_SUM_BP decoding algorithm the signal/noise is not required. The resulted characteristics of product codes constructed with usage of LDPC based on project geometry (length of code words, information volume, code rate, error performances) are presented in this paper. These component LDPC codes are cyclic and have encoding and decoding algorithms with low complexity implementation. The computer simulations for encoding and iterative symbol-by-symbol decoding algorithms for the number of turbo-codes with different code rate and information volumes are performed. The results of computer simulations have shown that MIN_SUM_BP decoding algorithm is more effective than BP decoding algorithm for channel with additive white gaussian noise concerning error-performances.