Improving DFA attacks on AES with unknown and random faults

Liao, Nan; Cui, Xiaoxin; Liao, Kai; Wang, Tian; Yu, Dunshan; Cui, Xiaole

doi:10.1007/s11432-016-0071-7

Cited by 11 publications

(17 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2017, Nan Liao et al proposed improved DFA attacks on AES with multibyte faults [10]. Since our method is based on their contributions, their method is introduced first.…”

Section: Dfa Methods Proposed By Nan Liao Et Almentioning

confidence: 99%

“…It is claimed in [10] that P candidates decides the number of ciphertext pairs required in the DFA attack. If small P candidates like 1 is used in the attack, the number of ciphertext pairs required will be greatly reduced and the efficiency of the attack will be increased.…”

Section: Dfa Methods Proposed By Nan Liao Et Almentioning

confidence: 99%

“…Application on AES [10]. In [10], the attack successfully recovers the correct round-key with 2-5 pairs of ciphertexts in most cases.…”

Section: Proposed Dfa Methods Andmentioning

confidence: 99%

“…In 2017, Nan Liao et al [10] proposed an improved DFA attack method on AES with unknown and random faults. They focused on multibyte faults whose locations and values are unknown to the attackers.…”

Section: Related Workmentioning

confidence: 99%

“…Section 3 explains a classical DFA on AES and Liao's method in [10]. Two strategies applied to DFA attacks on AES we propose are introduced in Section 4.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Towards Optimized DFA Attacks on AES under Multibyte Random Fault Model

Wang

Meng

et al. 2018

Security and Communication Networks

View full text Add to dashboard Cite

Differential Fault Analysis (DFA) is one of the most practical methods to recover the secret keys from real cryptographic devices. In particular, DFA on Advanced Encryption Standard (AES) has been massively researched for many years for both single-byte and multibyte fault model. For AES, the first proposed DFA attack requires 6 pairs of ciphertexts to identify the secret key under multibyte fault model. Until now, the most efficient DFA under multibyte fault model proposed in 2017 can complete most of the attacks within 3 pairs of ciphertexts. However, we note that the attack is not fully optimized since no clear optimization goal was set. In this work, we introduce two optimization goals as the fewest ciphertext pairs and the least computational complexity. For these goals, we manage to figure out the corresponding optimized key recovery strategies, which further increase the efficiency of DFA attacks on AES. A more accurate security assessment of AES can be completed based on our study of DFA attacks on AES. Considering the variations of fault distribution, the improvement to the attack has been analyzed and verified.

show abstract

“…In 2017, Nan Liao et al proposed improved DFA attacks on AES with multibyte faults [10]. Since our method is based on their contributions, their method is introduced first.…”

Section: Dfa Methods Proposed By Nan Liao Et Almentioning

confidence: 99%

Section: Dfa Methods Proposed By Nan Liao Et Almentioning

confidence: 99%

“…Application on AES [10]. In [10], the attack successfully recovers the correct round-key with 2-5 pairs of ciphertexts in most cases.…”

Section: Proposed Dfa Methods Andmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

“…Section 3 explains a classical DFA on AES and Liao's method in [10]. Two strategies applied to DFA attacks on AES we propose are introduced in Section 4.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations