论文标题
信息集使用限制球为Lee-ie-metric代码解码
Information Set Decoding for Lee-Metric Codes using Restricted Balls
论文作者
论文摘要
Lee公制综合征解码问题是NP硬化问题，已经提出了一些通用解码器。关于此类解码器的成本比其锤量指标的观察结果使Lee Metric成为基于古典代码的密码学的有希望的替代方案。与锤量指标不同，在给定的Lee重量的随机选择均匀的统一的误差矢量预计只有很少的Lee重量的条目。使用这种预期的条目分布，我们能够通过将原始问题降低到较小的实例，该实例的溶液生存在受限的球中，从而大大降低了Lee指标中通用解码器的成本。
The Lee metric syndrome decoding problem is an NP-hard problem and several generic decoders have been proposed. The observation that such decoders come with a larger cost than their Hamming metric counterparts make the Lee metric a promising alternative for classical code-based cryptography. Unlike in the Hamming metric, an error vector that is chosen uniform at random of a given Lee weight is expected to have only few entries with large Lee weight. Using this expected distribution of entries, we are able to drastically decrease the cost of generic decoders in the Lee metric, by reducing the original problem to a smaller instance, whose solution lives in restricted balls.
