About One Algorithm for Correcting Bursts Using Block-Permutation LDPC-Codes

Veresova, A. M.; Ovchinnikov, A. A.

doi:10.1109/weconf.2019.8840580

Cited by 8 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similar to the fact that the minimal distance d 0 defines the maximal number t of independent errors, which can be corrected in any combination by minimal distance decoding, for each linear code the maximal correctable burst length b may be determined -this means that all possible error bursts of length no more than b are in different cosets and may be chosen as leaders. However, as it was mentioned earlier, finding the minimal distance of the random code is NP-hard, while maximal correctable burst length may be found in polynomial-time, using procedure from [16] (though the degree of the polynomial is rather large).…”

Section: кодирование и передача информацииmentioning

confidence: 99%

See 1 more Smart Citation

The variant of post-quantum cryptosystem based on burst-correcting codes and on the complete decoding problem

Овчинников

2022

ICS

View full text Add to dashboard Cite

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 mathematical code-based tasks. Purpose: The development of public-key code-based cryptosystem using low-density parity-check codes with burst correction; the estimation of the parameters of the obtained system. Results: The variant of code-based cryptosystem using random block permutation low-density parity-check codes is proposed. The cryptocomplexity of the system is supposed to be based on the complete decoding problem, which is believed to be a harder mathematical problem than those used in existing systems. With high probability, the analysis of the system by using decoding methods is not possible at all, which both increases the long-term cryptocomplexity of the system and allows to reduce the key size. The evaluation of the underlying code selection is performed, the approaches to the selection of the parameters of the proposed system on the basis of the required level of cryptocomplexity are considered. Practical relevance: The proposed system allows to reduce the public-key size as compared to the classical McEliece system, cryptocomplexity also comparable, with the underlying mathematical problem to be more stable against perspective attacks.

show abstract

Section: кодирование и передача информацииmentioning

confidence: 99%

“…Traditionally LDPC codes are used to correct independent errors, however, in [16,19,20] the capability of these codes (in particular, block-permutation constructions) to correct bursts of errors was analyzed. In [16] both the procedure of determining the maximal length of correctable burst and decoding procedure for block-permutation LDPC code are described.…”

mentioning

confidence: 99%