An upper-bound on the decoding failure probability of the LRPC decoder
type: Item
instance of: scholarly article
title: An upper-bound on the decoding failure probability of the LRPC decoder
DOI: 10.1007/978-3-031-47818-5_1
author: Étienne Burle
author: Ayoub Otmani
publication date: 2024-08-30T00:00:00Z
Mathematics Subject Classification ID: 94B35
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7904511
zbMATH Keywords: rank metric
zbMATH Keywords: decoding problem
zbMATH Keywords: LRPC code
zbMATH Keywords: homogeneous matrix
MaRDI profile type: MaRDI publication profile
cites work: LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
cites work: Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
cites work: Bilinear forms over a finite field, with applications to coding theory
cites work: Theory of codes with maximum rank distance
cites work: Q4037491
cites work: Severely denting the Gabidulin version of the McEliece public key cryptosystem
cites work: The Security of the Gabidulin Public Key Cryptosystem
cites work: On a special class of polynomials.
cites work: Theory of non-commutative polynomials
cites work: Coding and Cryptography
cites work: Progress in Cryptology – Mycrypt 2005
cites work: Structural attacks for public key cryptosystems based on Gabidulin codes
description: scientific article; zbMATH DE number 7904511