Weak keys in the McEliece public-key cryptosystem

DOI10.1109/18.915687zbMath0994.94029OpenAlexW2113494858MaRDI QIDQ4544559

Nicolas Sendrier, Pierre Loidreau

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.915687

zbMATH Keywords

McEliece public-key cryptosystembinary generator polynomialsecret Goppa code

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (13)

Structural cryptanalysis of McEliece schemes with compact keys ⋮ A Summary of McEliece-Type Cryptosystems and their Security ⋮ Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes ⋮ How to backdoor (classic) McEliece and how to guard against backdoors ⋮ Breaking Goppa-based McEliece with hints ⋮ Decoding McEliece with a hint -- secret Goppa key parts reveal everything ⋮ A side-channel attack against \textit{Classic McEliece} when loading the Goppa polynomial ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions ⋮ On the dimension of the subfield subcodes of 1-point Hermitian codes ⋮ Semantic security for the McEliece cryptosystem without random oracles ⋮ Counting extended irreducible Goppa codes ⋮ How to mask the structure of codes for a cryptographic use

Uses Software

• McEliece

This page was built for publication: Weak keys in the McEliece public-key cryptosystem