Information set decoding of Lee-metric codes over finite rings

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.

[1]  Stanislav Bulygin,et al.  On lower bounds for information set decoding over Fq and on the effect of partial knowledge , 2017 .

[2]  Anne Canteaut,et al.  A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece’s Cryptosystem and to Narrow-Sense BCH Codes of Length , 1998 .

[3]  Jeffrey S. Leon,et al.  A probabilistic algorithm for computing minimum weights of large error-correcting codes , 1988, IEEE Trans. Inf. Theory.

[4]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[5]  Christiane Peters,et al.  Information-Set Decoding for Linear Codes over Fq , 2010, PQCrypto.

[6]  Matthieu Finiasz,et al.  Security Bounds for the Design of Code-Based Cryptosystems , 2009, ASIACRYPT.

[7]  Enrico Thomae,et al.  Decoding Random Linear Codes in Õ(20.054n) , 2012 .

[8]  Joachim Rosenthal,et al.  Generalization of the Ball-Collision Algorithm , 2018, ArXiv.

[9]  Ernest F. Brickell,et al.  An Observation on the Security of McEliece's Public-Key Cryptosystem , 1988, EUROCRYPT.

[10]  Shoichi Hirose,et al.  Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field \mathbb F_q , 2017, C2SI.

[11]  Eugene Prange,et al.  The use of information sets in decoding cyclic codes , 1962, IRE Trans. Inf. Theory.

[12]  Nicolas Sendrier,et al.  Analysis of Information Set Decoding for a Sub-linear Error Weight , 2016, PQCrypto.

[13]  Sidi Mohamed El Yousfi Alaoui,et al.  A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem , 2010, Selected Areas in Cryptography.

[14]  Elwyn R. Berlekamp,et al.  On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[15]  Daniel Smith-Tone,et al.  Report on Post-Quantum Cryptography , 2016 .

[16]  Matthieu Finiasz,et al.  How to Achieve a McEliece-Based Digital Signature Scheme , 2001, ASIACRYPT.

[17]  Philippe Gaborit,et al.  On the Complexity of the Rank Syndrome Decoding Problem , 2013, IEEE Transactions on Information Theory.

[18]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[19]  Antoine Joux,et al.  Decoding Random Binary Linear Codes in 2n/20: How 1+1=0 Improves Information Set Decoding , 2012, IACR Cryptol. ePrint Arch..

[20]  Shoichi Hirose.  May-Ozerov Algorithm for Nearest-Neighbor Problem over 𝔽q and Its Application to Information Set Decoding , 2016, SECITC.

[21]  Tanja Lange,et al.  Smaller decoding exponents: ball-collision decoding , 2011, IACR Cryptol. ePrint Arch..

[22]  Ron M. Roth,et al.  Introduction to Coding Theory , 2019, Discrete Mathematics.

[23]  Jacques Stern,et al.  A New Identification Scheme Based on Syndrome Decoding , 1993, CRYPTO.

[24]  S. Goldwasser.  Improved Identification Schemes Based on Error-Correcting Codes , 1995 .

[25]  Anne Canteaut,et al.  Cryptanalysis of the Original McEliece Cryptosystem , 1998, ASIACRYPT.

[26]  F. Chabaud.  Asymptotic Analysis of Probabilistic Algorithms for Finding Short Codewords , 1993 .

[27]  Anna-Lena Horlemann-Trautmann,et al.  Information Set Decoding in the Lee Metric with Applications to Cryptography , 2019, ArXiv.

[28]  Marco Baldi,et al.  On the use of ordered statistics decoders for low-density parity-check codes in space telecommand links , 2016, EURASIP J. Wirel. Commun. Netw..

[29]  Thomas Johansson,et al.  New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications , 2002, Probl. Inf. Transm..

[30]  Daniel J. Bernstein,et al.  Grover vs. McEliece , 2010, PQCrypto.

[31]  Shu Lin,et al.  Soft-decision decoding of linear block codes based on ordered statistics , 1994, IEEE Trans. Inf. Theory.