Attacking and defending the McEliece cryptosystem

By Daniel J. Bernstein, Tanja Lange, C. Peters. IACR Cryptology ePrint Archive, 2008

402 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes (2013, methodology): “Table II presents parameters for the QC-MDPC variant and Table III a key-size comparison to [12] (keys in systematic form), [7] and [28].”
Decoding Random Binary Linear Codes in 2n/20: How 1+1=0 Improves Information Set Decoding (2012, background): “Notice that three out of the four parameter sets for security levels between 80 and 256 bit from [3] closely match these code parameters.”
Post-quantum cryptography (2008, neutral): “McEliece’s original key sizes were designed for 264 security, and our successful attack against those key sizes thirty years later [25] took more than 260 CPU cycles.”