首页/论文/2001.08425

arXiv 2001.084252020-01cs.CRcs.ITmath.IT

Information set decoding of Lee-metric codes over finite rings

Violetta Weger, Massimo Battaglioni, Paolo Santini, Franco Chiaraluce, Marco Baldi, Edoardo Persichetti

备注：: This is a preliminary result, which we have included in a new paper with new authors and thus not considered it as a replacement

英文摘要：

Information set decoding (ISD) algorithms are the best known procedures to solve the decoding problem for general linear codes. These algorithms are hence used for codes without a visible structure, or for which efficient decoders exploiting the code structure are not known. Classically, ISD algorithms have been studied for codes in the Hamming metric. In this paper we switch from the Hamming metric to the Lee metric, and study ISD algorithms and their complexity for codes measured with the Lee metric over finite rings.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Information Set Decoding for Lee-Metric Codes using Restricted Balls

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 o…

2022-05-25cs.CRcs.ITmath.IT

On the Hardness of the Lee Syndrome Decoding Problem

In this paper we study the hardness of the syndrome decoding problem over finite rings endowed with the Lee metric. We first prove that the decisional version of the problem is NP-complete, by a reduction from the $3$-dimensional matching problem. Then, we study the complexity of solving the problem, by translating the best known solvers in the Hamming metric over finite fields to the Lee metric over finite rings, as well as proposing some novel solutions. For the analyzed algorithms, we assess the computational complexity in the asymptotic regime and compare it to the corresponding algorithms…

2022-04-01cs.CRcs.ITmath.IT

Lee度量下伴随式译码问题的零知识证明

A Zero-Knowledge Proof for the Syndrome Decoding Problem in the Lee Metric

针对Lee度量下的伴随式译码问题（代码密码学的NP完全问题变体），本文提出了一种知识的零知识证明，为构建更高效的代码密码系统提供支持。

2025-07-31cs.CRcs.ITmath.IT

Information Set Decoding in the Lee Metric with Applications to Cryptography

We convert Stern's information set decoding (ISD) algorithm to the ring $\mathbb{Z}/4 \mathbb{Z}$ equipped with the Lee metric. Moreover, we set up the general framework for a McEliece and a Niederreiter cryptosystem over this ring. The complexity of the ISD algorithm determines the minimum key size in these cryptosystems for a given security level. We show that using Lee metric codes can drastically decrease the key size, compared to Hamming metric codes. In the end we explain how our results can be generalized to other Galois rings $\mathbb{Z}/p^s\mathbb{Z}$.

2020-04-27cs.CR

Classical and Quantum algorithms for generic Syndrome Decoding problems and applications to the Lee metric

The security of code-based cryptography usually relies on the hardness of the syndrome decoding (SD) problem for the Hamming weight. The best generic algorithms are all improvements of an old algorithm by Prange, and they are known under the name of Information Set Decoding (ISD) algorithms. This work aims to extend ISD algorithms' scope by changing the underlying weight function and alphabet size of SD. More precisely, we show how to use Wagner's algorithm in the ISD framework to solve SD for a wide range of weight functions. We also calculate the asymptotic complexities of ISD algorithms bot…

2021-09-15cs.CR

Reed-Solomon码和折叠Reed-Solomon码在Galois环上的列表解码

List Decoding of Reed-Solomon Codes and Folded Reed-Solomon Codes Over Galois Ring

School of Computer Science, Shanghai Jiao Tong University（上海交通大学计算机学院）

本文研究了Reed-Solomon码和折叠Reed-Solomon码在Galois环上的列表解码问题，证明了其解码半径可达Singleton界，并改进了列表大小。

2026-07-13cs.CRcs.ITmath.IT

更多相关论文收起更多论文

Lee度量后量子密码系统中基于格的漏洞

Lattice-Based Vulnerabilities in Lee Metric Post-Quantum Cryptosystems

本文针对基于Lee度量的McEliece型密码系统，评估了其抵御基于格的攻击的安全性，揭示了为减小密钥尺寸而采用替代度量可能引入的潜在漏洞。

2024-10-15cs.CRcs.ITmath.IT

Generalized Inverse Based Decoding

The concept of Generalized Inverse based Decoding (GID) is introduced, as an algebraic framework for the syndrome decoding problem (SDP) and low weight codeword problem (LWP). The framework has ground on two characterizations by generalized inverses (GIs), one for the null space of a matrix and the other for the solution space of a system of linear equations over a finite field. Generic GID solvers are proposed for SDP and LWP. It is shown that information set decoding (ISD) algorithms, such as Prange, Lee-Brickell, Leon, and Stern's algorithms, are particular cases of GID solvers. All of them…

2022-02-17cs.CRcs.ITmath.IT

有限环密码系统中的规范字节字符串编码

Canonical Byte-String Encoding for Finite-Ring Cryptosystems

本文提出了一种规范的字节到余数映射层，用于有限环密码系统中的代数加密步骤，通过基于rANS的系统实现，并提供形式化验证和性能基准。

2026-05-11cs.CRcs.ITmath.IT

有限环$\mathbb{Z}_k$上的码、MacWilliams恒等式与Theta函数

Codes over Finite Ring $\mathbb{Z}_k$, MacWilliams Identity and Theta Function

本文基于格和Theta函数研究有限环$\mathbb{Z}_k$上的线性码，推广现有工作得到完全及对称重量计数器的MacWilliams恒等式，还在$k$为素数时建立Theta函数与汉明重量计数器的关系。

2025-04-17cs.CRcs.ITmath.IT

Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power

We define and analyze low-rank parity-check (LRPC) codes over extension rings of the finite chain ring $\mathbb{Z}_{p^r}$, where $p$ is a prime and $r$ is a positive integer. LRPC codes have originally been proposed by Gaborit et al.(2013) over finite fields for cryptographic applications. The adaption to finite rings is inspired by a recent paper by Kamche et al. (2019), which constructed Gabidulin codes over finite principle ideal rings with applications to space-time codes and network coding. We give a decoding algorithm based on simple linear-algebraic operations. Further, we derive an upp…

2020-05-15cs.CRcs.ITmath.IT

基于拟阿贝尔译码困难性的相关伪随机性

Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding

本文提出拟阿贝尔校正子译码问题QA-SD，并据此构造任意q>2域上支持OLE的可编程PCG，突破大域与可分裂Ring-LPN限制，得到首个高效N方静默通用算术电路安全计算协议。

2023-06-06cs.CRcs.ITmath.IT

Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding

We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding small solutions of polynomial equations modulo integers to analogous problems over polynomial rings, number fields, and function fields. This gives us a unified view of several problems arising naturally in cryptography, coding theory, and the study of lattices. We give (1) a polynomial-time algorithm for finding small solutions of polynomial equations modulo ideals over algebraic number fields, (2) a faster variant of …

2013-06-25cs.CRcs.ITmath.IT

On Codes and Learning With Errors over Function Fields

It is a long standing open problem to find search to decision reductions for structured versions of the decoding problem of linear codes. Such results in the lattice-based setting have been carried out using number fields: Polynomial-LWE, Ring-LWE, Module-LWE and so on. We propose a function field version of the LWE problem. This new framework leads to another point of view on structured codes, e.g. quasi-cyclic codes, strengthening the connection between lattice-based and code-based cryptography. In particular, we obtain the first search to decision reduction for structured codes. Following t…

2022-02-28cs.CRmath.NT