Кафедри
Постійне посилання на розділhttps://repository.kpi.kharkov.ua/handle/KhPI-Press/35393
Переглянути
2 результатів
Результати пошуку
Документ Development of McEliece modified asymmetric crypto-code system on elliptic truncated codes(ПП "Технологічний Центр", 2016) Yevseiev, S. P.; Rzayev, Kh.; Korol, O. G.; Imanova, Z.Symmetric and asymmetric cryptographic algorithms, providing the required level of cryptographic strength are generally used to ensure security in modern communication systems, and error-correcting coding techniques - to ensure reliability. The use of asymmetric crypto-code systems enables integrated (with one mechanism) provision of the required levels of reliability, security and efficiency in the processing and transmission of confidential information via open channels of telecommunication systems. The research confirms that their usage provides high performance on the level of symmetric encryption algorithms with BSSH, provable cryptographic strength based on theoretical and complexity problems in arbitrary code decoding (1030 – 1035 group operations are provided), and reliability through the use of a shortened algebra-geometric code (Рош10-9 – 10-12 is provided). A major disadvantage of the use of the McEliece cryptographic system are large amounts of critical data (to provide the required cryptographic strength it is necessary to build a system in the GF (210 – 213). In order to reduce the volume of key data (public key), we propose to use shortened codes, that enables to reduce the GF(26 –28), while maintaining a cryptographic strength level, by introducing the character location entropy at initialization vector.Документ Mathematical model of the modified niederreiter crypto-code structures(Національний технічний університет "Харківський політехнічний інститут", 2018) Tsyhanenko, O.; Rzayev, Kh.; Mammadova, T.Subject of researchis the modification of the Niederreiter crypto-code construction on non-binary codes. The purpose of this work is to develop a mathematical model of a modified Niederreiter crypto-code structure using algebro-geometric block codes with a shortening of the information parcel. The tasks to be solved are: to formalize the procedures for the formation of codograms and their further decoding; develop a mathematical model of the Niederreiter crypto-code structure modified by shortening the information parcel and fixing the admissible positional vectors of the plaintext transformation based on equilibrium coding. The following results were obtained. Studies of the Niederreiter crypto-code structures in MES revealed the main reason for the impossibility of the practical implementation of decoding algorithms when using non-binary codes in the classical scheme. It has been established that it is necessary to fix a subset of plaintext for which the error localization procedure, with the X, P and D (private key) masking matrices selected by the sender, cannot be performed. With its help, we need to "weed out" the error vector sets that do not allow using the classical version of decoding information on the receiving side when using the classical Niederreiter scheme on m-th codes. When constructing a mathematical model, the identified feature was considered. As a result, a mathematical model of the Niederreiter crypto-code structure modified by shortening the information package and fixing admissible positional vectors of the plaintext transformation based on equilibrium coding is obtained. The scientific novelty of the obtained results is as follows: the proposed modified mathematical model of the Niederreiter crypto-code structure ensures its practical implementation. Reducing the field power when building a classic Niederreiter scheme reduces the amount of data transferred by shortening the error vector before generating the syndrome on the sender side and, accordingly, the energy costs of its implementation; The use of the quantum-stable and promising Niederreiter crypto-code construction has been further developed, the identified feature and the proposed modification ensure its competitiveness.