?
On the Question of the Resistance of Code-Based Cryptosystems to Matrix Density Reduction Attacks
P. 1–4.
Methods for reducing the density of matrices are
discussed. These methods can be used to analyze the
cryptocomplexity of systems based on error-correcting codes.
Lowering the density of matrices can affect both the stability of
systems that use low-density codes as a private key, and the
stability of general systems in which decryption requires solving
the problem of decoding errors of a given multiplicity. The article
presents the results of experiments for the considered methods of
reducing the density.