Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation

DOI10.1007/978-3-030-64837-4_29OpenAlexW3112663777MaRDI QIDQ2692373

Norman Lahr, Ruben Niederhagen, Simona Samardjiska, Richard Petri

Publication date: 21 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-64837-4_29

zbMATH Keywords

FPGASCAreaction attackNiederreiterPQCclassic McElieceISDiterative chunking

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

SoK: how (not) to design and implement post-quantum cryptography, Information-set decoding with hints, Punctured syndrome decoding problem. Efficient side-channel attacks against \textit{Classic McEliece}, S-semantics -- an example, Exploiting ROLLO's constant-time implementations with a single-trace analysis, Improved information set decoding algorithms over Galois ring in the Lee metric, A side-channel attack against \textit{Classic McEliece} when loading the Goppa polynomial, Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem

Uses Software

• McEliece
• McBits
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• Two decoding algorithms for linear codes
• FPGA-based Niederreiter cryptosystem using binary Goppa codes
• A reaction attack against cryptosystems based on LRPC codes
• McBits: Fast Constant-Time Code-Based Cryptography
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
• A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
• Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
• Post-Quantum Cryptography
• Security Bounds for the Design of Code-Based Cryptosystems
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• On the inherent intractability of certain coding problems (Corresp.)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the edge-independence number and edge-covering number for regular graphs
• A Side-Channel Assisted Cryptanalytic Attack Against QcBits
• McBits Revisited
• Smaller Decoding Exponents: Ball-Collision Decoding
• Power Analysis Attacks