Timing attacks against the syndrome inversion in code-based cryptosystems
From MaRDI portal
Recommendations
- Preventing timing attacks against RQC using constant time decoding of Gabidulin codes
- A timing attack against the secret permutation in the McEliece PKC
- A practicable timing attack against HQC and its countermeasure
- McBits: fast constant-time code-based cryptography
- A timing attack on the HQC encryption scheme
Cited in
(13)- A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformation and its application on FrodoKEM
- Information-set decoding with hints
- Don't forget your roots: constant-time root finding over \(\mathbb{F}_{2^m}\)
- Preventing timing attacks against RQC using constant time decoding of Gabidulin codes
- Toward secure implementation of McEliece decryption
- McBits: fast constant-time code-based cryptography
- Polynomial structures in code-based cryptography
- On weak keys and forgery attacks against polynomial-based MAC schemes
- A timing attack against the secret permutation in the McEliece PKC
- S-semantics -- an example
- Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems
- Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes
- Accelerating and verifying constant-time modular inversion
This page was built for publication: Timing attacks against the syndrome inversion in code-based cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928599)
