NP-completeness of Certain Sub-classes of the Syndrome Decoding Problem

Details NP-completeness of Certain Sub-classes of the Syndrome Decoding Problem NP-completeness of Certain Sub-classes of the Syndrome Decoding Problem

2009-12-02

arxiv.org/abs/0912.0453v1

Computer Science

Cryptography and Security

Scientific paper

The problem of Syndrome Decoding was proven to be NP-complete in 1978 and, since then, quite a few cryptographic applications have had their security rely on the (provable) difficulty of solving some instances of it. However, in most cases, the instances to be solved follow some specific constraint: the target weight is a function of the dimension and length of the code. In these cases, is the Syndrome Decoding problem still NP-complete? This is the question that this article intends to answer.

Affiliated with

Also associated with

No associations

Rating

NP-completeness of Certain Sub-classes of the Syndrome Decoding Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with NP-completeness of Certain Sub-classes of the Syndrome Decoding Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and NP-completeness of Certain Sub-classes of the Syndrome Decoding Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-510039