论文标题
交织的prange：一种用于交织代码的新通用解码器
Interleaved Prange: A New Generic Decoder for Interleaved Codes
论文作者
论文摘要
由于最近在量词后加密术中面临的挑战，已经提出了几种基于代码的密码学的新方法。例如，提出了基于交织代码的mceliece加密系统的变体。为了认为这种新设置安全，我们首先需要了解和分析基本问题的复杂性，在这种情况下，解码随机交织的代码的问题。一种简单的方法来解码此类代码，将是在接收到的矩阵的行中随机选择一个向量，并在此错误的代码字上运行一个经典信息集解码算法。在本文中，我们为交织代码提出了一个新的通用解码器，这是对prange的信息设置解码的经典概念的改编，并且完美地拟合了交织的设置。然后，我们分析了新算法的成本，并与上述简单方法进行了比较，显示了交错prange的优越性。
Due to the recent challenges in post-quantum cryptography, several new approaches for code-based cryptography have been proposed. For example, a variant of the McEliece cryptosystem based on interleaved codes was proposed. In order to deem such new settings secure, we first need to understand and analyze the complexity of the underlying problem, in this case the problem of decoding a random interleaved code. A simple approach to decode such codes, would be to randomly choose a vector in the row span of the received matrix and run a classical information set decoding algorithm on this erroneous codeword. In this paper, we propose a new generic decoder for interleaved codes, which is an adaption of the classical idea of information set decoding by Prange and perfectly fits the interleaved setting. We then analyze the cost of the new algorithm and a comparison to the simple approach described above shows the superiority of Interleaved Prange.
