Recovering short secret keys of RLCE in polynomial time

DOI10.1007/978-3-030-25510-7_8OpenAlexW2964118487MaRDI QIDQ2302130

Alain Couvreur, Matthieu Lequesne, Jean-Pierre Tillich

Publication date: 25 February 2020

Full work available at URL: https://arxiv.org/abs/1805.11489

zbMATH Keywords

distinguisherSchur product of codeskey recovery attackcode based cryptographygeneralised Reed Solomon codesMcEliece schemeRLCE

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (4)

Properties of constacyclic codes under the Schur product ⋮ Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem ⋮ Quantum Resistant Public Key Encryption Scheme polarRLCE ⋮ Cryptanalysis of a system based on twisted Reed-Solomon codes

This page was built for publication: Recovering short secret keys of RLCE in polynomial time