On the generic complexity of the decoding problem for linear codes | Applied Discrete Mathematics. Supplement. 2019. № 12. DOI: 10.17223/2226308X/12/56

On the generic complexity of the decoding problem for linear codes

Generic-case approach to algorithmic problems was introduced by Miasnikov, Kapovich, Schupp and Shpilrain in 2003. This approach studies behavior of an algorithm on typical (almost all) inputs and ignores the rest of inputs. Many classical undecidable or hard algorithmic problems become feasible in the generic case. But there are generically hard problems. In this paper, we consider generic complexity of the decoding problem for linear codes over finite fields. We fit this problem in the frameworks of generic complexity and prove that its natural subproblem is generically hard provided that this problem is hard in the worst case.

Download file

Counter downloads: 150

Keywords

генерическая сложность, линейные коды, криптосистема Мак-Эллиса, generic complexity, linear codes, McEliece cryptosystem

Authors

Name	Organization	E-mail
Rybalov A.N.	Dostoevsky Omsk State University	alexander.rybalov@gmail.com

Всего: 1

References

McEliece R. J. A public-key cryptosystem based on algebraic coding theory // DSN Progress Report. 1978. V.42. No. 44. P. 111-116.

Романьков В. А. Введение в криптографию. 2-е изд., испр. М.: ФОРУМ, 2012. 240с.

Рыбалов А. Н. Введение в теорию кодов, исправляющих ошибки. Омск: Изд-во Ом. ун-та, 2007. 131с.

Berlekamp E., McEliece R., and Van Tilborg H. On the inherent intractability of certain coding problems // IEEE Trans. Inform. Theory. 1978. V.24(3). P. 384-386.

Kapovich I., Miasnikov A, Schupp P., and Shpilrain V. Generic-case complexity, decision problems in group theory and random walks // J. Algebra. 2003. V. 264. No. 2. P. 665-694.

Impagliazzo R. and Wigderson A. P=BPP unless E has subexponential circuits: Derandomizing the XOR lemma // Proc. 29th STOC. El Paso: ACM, 1997. P. 220-229.