2015
DOI: 10.1007/978-3-319-26617-6_14
|View full text |Cite
|
Sign up to set email alerts
|

Differential Fault Analysis of SHA-3

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
67
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 24 publications
(68 citation statements)
references
References 32 publications
0
67
0
Order By: Relevance
“…3 and use these notations in the rest of this paper. We pick the penultimate round input (θ 22 i ) as the fault injection point, and the target is to recover the whole internal state of χ 22 i (1600 bits) with access to the digest H at much shorter length, which is dbit for SHA3-d function. The key insight of DFA is that the fault injection reveals some internal state bits through the differential digest output (the difference between the correct digest and faulty digest).…”
Section: Notations and Data Structurementioning
confidence: 99%
See 4 more Smart Citations
“…3 and use these notations in the rest of this paper. We pick the penultimate round input (θ 22 i ) as the fault injection point, and the target is to recover the whole internal state of χ 22 i (1600 bits) with access to the digest H at much shorter length, which is dbit for SHA3-d function. The key insight of DFA is that the fault injection reveals some internal state bits through the differential digest output (the difference between the correct digest and faulty digest).…”
Section: Notations and Data Structurementioning
confidence: 99%
“…As the single-bit fault model used in [22] is just a special case of the single-byte fault model, we will also check attack results under that model.…”
Section: The Fault Model Used In This Papermentioning
confidence: 99%
See 3 more Smart Citations