Weak keys in the Faure-Loidreau cryptosystem

DOI10.1007/978-3-030-25922-8_6MaRDI QIDQ6199261zbMATH OpenOpenAlexFDO

Authors Thomas Jerkovits, Hannes Bartz

Publication date 23 February 2024

Published in Code-Based Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-25922-8_6

zbMATH Keywords

code-based cryptographyFaure-LoidreauGabidulin codesgeneralized minimum distance (GMD) decodinginterleavingpost-quantum cryptographyrank-metric codes

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Recommendations

• Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes
• Weak keys in the McEliece public-key cryptosystem
• Weak keys for the quasi-cyclic MDPC public key encryption scheme
• The non-gap sequence of a subcode of a generalized Reed-Solomon code
• Structural cryptanalysis of McEliece schemes with compact keys

Cited in

(1)

• Randomized decoding of Gabidulin codes beyond the unique decoding radius

This page was built for publication: Weak keys in the Faure-Loidreau cryptosystem

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