?
About One Method of Constructing a Code-Based Cryptosystem Based on Quasi-Cyclic Codes
P. 1–5.
Isaeva M., Ovchinnikov A.
This article discusses the problem of constructing a public-key code-based cryptosystem based on quasi-cyclic codes
and the hard task of complete decoding. Experiments analyzing the correcting ability of the considered code system are
presented. The ways of increasing the corrective ability of this code system are proposed.
Kuninets A., Malygina E., Nesterenko A. et al., Journal of Computer Virology and Hacking Techniques 2026 No. 22
This work describes a post-quantum lattice-based linkable ring signature scheme over NTRU lattices, constructed within the Raptor framework. Our design incorporates the Ducas–Prest Gaussian sampler, the signature generation and verification algorithms from the Falcon scheme, and the key generation algorithm from the Mitaka scheme. This hybrid approach combines Falcon’s compact signatures and fast verification with ...
Added: January 23, 2026
Kuninets A., Malygina E., Прикладная дискретная математика 2024 № 65 С. 84–109
Представлен обзор квазициклических альтернантных кодов и их структурный анализ относительно классификации автоморфизмов. Детализированы методы восстановления структурной информации о коде, которые, в свою очередь, снабжены подробными примерами. Привлекательность рассматриваемого семейства кодов заключается в его возможном криптографическом приложении и, как следствие, в уменьшении длины ключа постквантовых схем на кодах, исправляющих ошибки. К тому же данный метод построения ...
Added: December 12, 2025
Kuninets A., Прикладная дискретная математика. Приложение 2024 № 17 С. 147–152
Представлен обзор квазициклических альтернантных кодов и их структурный анализ относительно классификации автоморфизмов. Детализированы методы восстановления структурной информации о коде. Привлекательность рассматриваемого семейства кодов заключается в его возможном криптографическом приложении и, как следствие, в уменьшении длины ключа постквантовых схем на кодах, исправляющих ошибки. К тому же данный метод построения кодов является универсальным и может быть применён ...
Added: December 12, 2025
Veresova A., Ovchinnikov A., , in: 2025 XIХ International Symposium on Problems of Redundancy in Information and Control Systems (Redundancy), 5-7 Nov. 2025.: IEEE, 2025. P. 1–5.
This paper addresses the problem of constructing
codes for correcting single error bursts. The construction is
based on a block-circulant design of low-density parity-check
codes. For such a design, the maximal correctable burst length
is limited by the block size, which forces consideration of codes
whose parity-check matrix contains only a small number of large
blocks. However, this significantly restricts the ...
Added: November 24, 2025
Якушенокс К. П., Ivanov F., / Series Computer Science "arxiv.org". 2023. No. 2312.15912.
Tavernier and Kabatiansky proposed new variants of the McEliece cryptosystem. In this letter, it is shown that cryptosystem based on correction of errors erasures is equal to the McEliece cryptosystem with worse parametrs public key. It will also add an organic extension of the authors’ idea, although one that has its flaws... ...
Added: September 4, 2024
E. S. Malygina, Kutsenko A. V., Novoselov S. A. et al., Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2023 Vol. 17 No. 4 P. 767–790
The paper provides an overview of the main approaches to the construction of post-quantum cryptographic systems that are currently used. The area of lattice-based cryptography is analyzed in detail. We give the description and characterization of some known lattice-based cryptosystems whose resilience is based on the complexity of the shortest vector problem, learning with errors ...
Added: March 19, 2024
Terry S. C., Ivanov F., Muhammad R. K. et al., Journal of Information Security and Applications 2023 Vol. 76 Article 103530
One main construct for code-based public key cryptosystems is the McEliece framework that hedges upon the hardness of decoding arbitrary linear codes. Based on Goppa codes, the original McEliece cryptosystem however, suffers from having very large public keys. To alleviate this problem, we define a new IKKR problem that is is NP-complete and use this assumption of the intracability if the ...
Added: December 28, 2022
Zyablov V., Ivanov F., Krouk E. et al., Problems of Information Transmission 2022 Vol. 58 No. 2 P. 184–201
We consider the problem of constructing a cryptosystem with a public key based on error-resistant coding. At present, this type of cryptosystems is believed to be able to resist the advent of quantum computers and can be considered as a method of post-quantum cryptography. The main drawback of a code-based cryptosystem is a great length ...
Added: October 26, 2022
Ovchinnikov A. А., Информационно-управляющие системы 2022 No. 3 P. 45–54
Introduction: Today the investigations of post-quantum cryptosystems secure against quantum computations is the area of great interest. An important direction here is code-based cryptography utilizing the mathematical problems from error-correcting coding theory. The improvement of existing code-based systems may be achieved both in practical part (reducing the key sizes) and theoretically by using more complicated ...
Added: September 26, 2022