Timing attacks against the syndrome inversion in code-based cryptosystems

DOI10.1007/978-3-642-38616-9_15MaRDI QIDQ4928599zbMATH OpenOpenAlexFDO

Authors Falko Strenzke

Publication date 14 June 2013

Published in Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38616-9_15

zbMATH Keywords

code-based cryptographyside channel attackpost quantum cryptographytiming attack

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

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

(12)

• A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformation and its application on FrodoKEM
• A timing attack against the secret permutation in the McEliece PKC
• Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes
• Toward secure implementation of McEliece decryption
• Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems
• McBits: fast constant-time code-based cryptography
• S-semantics -- an example
• Preventing timing attacks against RQC using constant time decoding of Gabidulin codes
• Information-set decoding with hints
• Don't forget your roots: constant-time root finding over \(\mathbb{F}_{2^m}\)
• Polynomial structures in code-based cryptography
• On weak keys and forgery attacks against polynomial-based MAC schemes

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)