Cryptology ePrint Archive: Report 2017/113
Algebraic Fault Analysis of SHA-3
Pei Luo and Konstantinos Athanasiou and Yunsi Fei and 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.
Category / Keywords: cryptographic protocols / SHA-3, Keccak, Algebraic fault analysis
Original Publication (in the same form): Design, Automation and Test in Europe (DATE), 2017
Date: received 11 Feb 2017
Contact author: silenceluo at gmail com
Available format(s): PDF | BibTeX Citation
Note: Source code will be provided online. Extension paper has been submitted and under review.
Version: 20170214:183445 (All versions of this report)
Short URL: ia.cr/2017/113
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]