Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
From MaRDI portal
Publication:5211530
DOI10.1109/TIT.2019.2933535zbMath1433.94152arXiv1904.00357OpenAlexW2967670694MaRDI QIDQ5211530
Olivier Ruatta, Adrien Hauteville, Nicolas Aragon, Gilles Zémor, Philippe Gaborit
Publication date: 28 January 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.00357
Related Items (9)
Cryptanalysis of the rank preserving signature ⋮ Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018 ⋮ LRPC codes with multiple syndromes: near ideal-size KEMs without ideals ⋮ Constructions of optimal rank-metric codes from automorphisms of rational function fields ⋮ Hardness estimates of the code equivalence problem in the rank metric ⋮ Analysis of the security of the PSSI problem and cryptanalysis of the Durandal signature scheme ⋮ 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 ⋮ Rank-Metric Codes and Their Applications
This page was built for publication: Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
