Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
From MaRDI portal
Publication:2056746
DOI10.1007/978-3-030-77886-6_15zbMath1479.94141OpenAlexW3168480899MaRDI QIDQ2056746
Alexandre Menu, Lilian Bossuet, Vlad-Florin Drăgoi, Brice Colombier, Pierre-Louis Cayrel
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_15
integer linear programmingcode-based cryptographysyndrome decoding problemclassic McEliecelaser fault injection
Integer programming (90C10) Linear programming (90C05) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items
SoK: how (not) to design and implement post-quantum cryptography, Punctured syndrome decoding problem. Efficient side-channel attacks against \textit{Classic McEliece}, Recovering Rainbow's secret key with a first-order fault attack, Exploiting ROLLO's constant-time implementations with a single-trace analysis, Key-recovery fault injection attack on the classic McEliece KEM, A one-time single-bit fault leaks all previous NTRU-HRSS session keys to a chosen-ciphertext attack, Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems, A side-channel attack against \textit{Classic McEliece} when loading the Goppa polynomial
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
- Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation
- 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
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Using Linear Programming to Decode Binary Linear Codes
- Bivium as a Mixed-Integer Linear Programming Problem
- Elliptic Curve Cryptosystems
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- New directions in cryptography
- On Finding Primal- and Dual-Optimal Bases
- A method for obtaining digital signatures and public-key cryptosystems
- On the inherent intractability of certain coding problems (Corresp.)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
- Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms
- Efficient Implementation of Linear Programming Decoding
- A Separation Algorithm for Improved LP-Decoding of Linear Block Codes
- Advanced Encryption Standard – AES
