伴随式译码问题中某些子类的NP完全性
NP-completeness of Certain Sub-classes of the Syndrome Decoding Problem
摘要:
伴随式译码问题在1978年被证明是NP-完全的,从那时起,许多密码学应用的安全性依赖于解决伴随式译码问题的某些实例的(可证明的)困难性,然而,在大多数情况下,要解决的实例遵循一些特定的约束:目标权重是码的维数和长度的函数。在这些情况下,综合征解码问题仍然是NP完全的吗?这就是本文要回答的问题。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。