Two new algorithms for error support recovery of low rank parity check codes

Abstract

Due to their weak algebraic structure, low rank parity check (LRPC) codes have been employed in several post-quantum cryptographic schemes. In this paper we propose new improved decoding algorithms for [n, k]qm LRPC codes of dual rank weight d. The proposed algorithms can efficiently decode LRPC codes with the parameters satisfying n − k = rd − c, where r is the dimension of the error support and c ≤ d − 2. They outperform the original decoding algorithm of LRPC codes when d > 2 and allow for decoding LRPC codes with a higher code rate and smaller values m.