A Statistical Explanation of the Timing Attack on QC-MDPC Code Crypto-system
Han Li

TL;DR
This paper presents a mathematical model that explains how timing and reaction attacks on QC-MDPC code-based cryptosystems exploit decoding performance, linking private key spectrum to decoder behavior.
Contribution
It introduces a unified statistical framework that elucidates the mechanics of timing and reaction attacks on QC-MDPC cryptosystems.
Findings
Connects private key spectrum to decoding performance
Provides a mathematical explanation for timing attack mechanics
Enhances understanding of attack vulnerabilities
Abstract
The McEliece cryptosystem based on quasi-cyclic moderate-density parity-check (QC-MDPC) codes is first purposed in 2013\cite{QCMDPC} and is considered a promising contender in the post-quantum era. Understanding its security is hence essential. Till now, the most effective attacks are the reaction attack\cite{Reaction} and the timing attack\cite{Timing}. Both of these attacks rely on the decoding performance to recover the private key. The reaction attack relies on the decoding failure rate and the timing attack relies on the iterations during decoding. However, the mechanics behind these attacks remain elusive. In this paper, a mathematical model is proposed to explain both attacks by connecting the spectrum of private key and first-layer performance of the decoder.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Error Correcting Code Techniques · Cryptographic Implementations and Security
