On breaking McEliece keys using brute force
From MaRDI portal
Cites work
- Attacking and Defending the McEliece Cryptosystem
- Code-based cryptography
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- scientific article; zbMATH DE number 177617 (Why is no real title available?)
- On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes
- On the Dimension of the Hull
- Symmetries of binary Goppa codes (Corresp.)
- The algebraic decoding of Goppa codes
- Understanding binary-Goppa decoding
- Weak keys in the McEliece public-key cryptosystem
This page was built for publication: On breaking McEliece keys using brute force
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7319508)