Paper 2017/113

Algebraic Fault Analysis of SHA-3

Pei Luo, Konstantinos Athanasiou, Yunsi Fei, and Thomas Wahl


This paper presents an efficient algebraic fault analysis on all four modes of SHA-3 under relaxed fault models. This is the first work to apply algebraic techniques on fault analysis of SHA-3. Results show that algebraic fault analysis on SHA-3 is very efficient and effective due to the clear algebraic properties of Keccak operations. Comparing with previous work on differential fault analysis of SHA-3, algebraic fault analysis can identify the injected faults with much higher rates, and recover an entire internal state of the penultimate round with much fewer fault injections.

Note: Source code will be provided online. Extension paper has been submitted and under review.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. Design, Automation and Test in Europe (DATE), 2017
SHA-3KeccakAlgebraic fault analysis
Contact author(s)
silenceluo @ gmail com
2017-02-14: received
Short URL
Creative Commons Attribution


      author = {Pei Luo and Konstantinos Athanasiou and Yunsi Fei and Thomas Wahl},
      title = {Algebraic Fault Analysis of SHA-3},
      howpublished = {Cryptology ePrint Archive, Paper 2017/113},
      year = {2017},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.