2018
DOI: 10.1109/tifs.2018.2790938
|View full text |Cite
|
Sign up to set email alerts
|

Algebraic Fault Analysis of SHA-3 Under Relaxed Fault Models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(17 citation statements)
references
References 14 publications
0
9
0
Order By: Relevance
“…First, we investigate how well is GA able to find faults (i.e., force the algorithm to output the wrong ciphertext) and then, whether such points can be used in order to obtain the state of the algorithm. For this purpose, we use algebraic fault analysis (AFA), as described in [17]. AFA eliminates the need for analysis of fault propagation as it is needed in differential fault analysis; instead, it uses a SAT solver to recover the state bits from a (clean output, faulty output) pair.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…First, we investigate how well is GA able to find faults (i.e., force the algorithm to output the wrong ciphertext) and then, whether such points can be used in order to obtain the state of the algorithm. For this purpose, we use algebraic fault analysis (AFA), as described in [17]. AFA eliminates the need for analysis of fault propagation as it is needed in differential fault analysis; instead, it uses a SAT solver to recover the state bits from a (clean output, faulty output) pair.…”
Section: Resultsmentioning
confidence: 99%
“…Algebraic fault analysis (AFA) seems more promising. Luo et al manage to bring down the number of faults needed to recover the internal state with SHA3-512 down to under 10 with AFA and the 32-bit fault model in the progress described in [15][16][17].…”
Section: Sha-3 Attack In Practicementioning
confidence: 99%
See 1 more Smart Citation
“…More recently fault attacks have been combined with SAT problem formulation in the so called Algebraic Fault Analysis [23], [24]. These approaches, still based on the injection of faults during the execution of the algorithm, allow to retrieve the secret key requiring a significantly reduced amount of corrupted digests, thus speeding-up the attack.…”
Section: A the Aes Algorithm And Dfa Attacks To Aesmentioning
confidence: 99%
“…There are two main categories of strategy for defending security attacks: new designed networking protocol-based cryptographic encryption approaches, and physical-layer security (PLS) approaches. One of the encryption methods, secured hash function, which can be implemented with several different algorithms, is applied in many fields such as data transfer safety, message authentication, and other user-linked information transfer [28,29]. However, this method is always realized in upper layers, which is challenging to implement in cooperative cognitive radio communication systems.…”
Section: Introductionmentioning
confidence: 99%