Algebraic Fault Analysis of SHA-3

Pei Luo; Konstantinos Athanasiou; Yunsi Fei; Thomas Wahl

Paper 2017/113 Original: eprint.iacr.org/2017/113 ↗

Algebraic Fault Analysis of SHA-3

Pei Luo

Konstantinos Athanasiou

Yunsi Fei

Thomas Wahl

Abstract

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.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
History: 2017-02-14: last updated; 2017-02-14: published
Short URL: https://ia.cr/2017/113
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2017/113,
      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},
      url = {https://eprint.iacr.org/2017/113}
}