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

DOI10.1007/978-3-031-47818-5_1MaRDI QIDQ6595931FDOQ6595931

Étienne Burle, Ayoub Otmani

Publication date: 30 August 2024

zbMATH Keywords

decoding problemrank metrichomogeneous matrixLRPC code

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Cites Work

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

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)