Skip to Main content Skip to Navigation
Conference papers

Persistent Fault Analysis With Few Encryptions

Abstract : Persistent fault analysis (PFA) consists in guessing block cipher secret keys by biasing their substitution box. This paper improves the original attack of Zhang et al. on AES-128 presented at CHES 2018. By a thorough analysis, the exact probability distribution of the ciphertext (under a uniformly distributed plaintext) is derived, and the maximum likelihood key recovery estimator is computed exactly. Its expression is turned into an attack algorithm, which is shown to be twice more efficient in terms of number of required encryptions than the original attack of Zhang et al. This algorithm is also optimized from a computational complexity standpoint. In addition, our optimal attack is naturally amenable to key enumeration, which expedites full 16-bytes key extraction. Various tradeoffs between data and computational complexities are investigated.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Olivier Rioul Connect in order to contact the contributor
Submitted on : Sunday, September 27, 2020 - 1:38:10 PM
Last modification on : Wednesday, November 3, 2021 - 8:15:32 AM
Long-term archiving on: : Thursday, December 3, 2020 - 6:37:45 PM


Files produced by the author(s)


  • HAL Id : hal-02950171, version 1


Sébastien Carré, Sylvain Guilley, Olivier Rioul. Persistent Fault Analysis With Few Encryptions. International Workshop on Constructive Side-Channel Analysis and Secure Design (COSADE 2020), Oct 2020, Lugano, Switzerland. ⟨hal-02950171⟩



Record views


Files downloads