An upper-bound on the decoding failure probability of the LRPC decoder

DOI10.1007/978-3-031-47818-5_1MaRDI QIDQ6595931zbMATH OpenFDO

Authors Étienne Burle, Ayoub Otmani

Publication date 30 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-47818-5_1

zbMATH Keywords

decoding problemrank metrichomogeneous matrixLRPC code

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Recommendations

• Low-rank parity-check codes over Galois rings
• Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer
• New Results for Rank-Based Cryptography
• A reaction attack against cryptosystems based on LRPC codes
• Blockwise rank decoding problem and LRPC codes: cryptosystems with smaller sizes

Cites work

• scientific article; zbMATH DE number 177612 (Why is no real title available?)
• Bilinear forms over a finite field, with applications to coding theory
• Coding and Cryptography
• LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
• Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
• On a special class of polynomials.
• Progress in Cryptology – Mycrypt 2005
• Severely denting the Gabidulin version of the McEliece public key cryptosystem
• Structural attacks for public key cryptosystems based on Gabidulin codes
• The security of the Gabidulin public key cryptosystem
• Theory of codes with maximum rank distance
• Theory of non-commutative polynomials

Cited in

(1)

• Injective rank metric trapdoor functions with homogeneous errors

This page was built for publication: An upper-bound on the decoding failure probability of the LRPC decoder

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595931)