Fault Analysis on a New Block Cipher DBlock with at Most Two Fault Injections

Feng, Jingyi; Chen, Hua; Gao, Si; Cao, Weiqiong; Fan, Li; Zhu, Shaofeng

doi:10.1049/cje.2018.09.003

Cited by 2 publications

(5 citation statements)

References 10 publications

(10 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The statistical results of attack process show that a certain number of fault injections recover most key bits. Combined with exhaustive search, we note that about 31 random nibble faults can recover the master key for GIFT-64 with a computational complexity of 2 16 and about 32 random nibble faults can recover the master key for GIFT-128 with a computational complexity of 2 17 . According to the analysis and experiments in this paper, GIFT is vulnerable to differential fault attack and the encryption device should be protected in actual use.…”

Section: Discussionmentioning

confidence: 97%

“…For RK 26 and RK 25 , there are similar experimental results. Combining with the method of exhaust search, we conclude that only 31 fault injections can recover K of GIFT-64 with a computational complexity of (2 4 × 30.6 + 2 8 × 20.6 + 2 12 × 14.6) × 4/16 × 1/28 + 2 16 ≈ 2 16 . The improved attack greatly reduces the number of fault injections and the difficulty of fault attacks at the level of implementation.…”

Section: Analysis and Improvementmentioning

confidence: 91%

“…Thereafter, Biham and Shamir combined this method with differential analysis and achieved good results in the security analysis of the classic block cipher DES [ 11 ] . This analysis method also called Differential fault analysis (DFA), which is one of the side channel attacks, has good analysis results for many block cipher algorithms [ 12–16 ] .…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Differential Fault Attack on GIFT

Xie

Tian

2021

Chinese J of Electronics

View full text Add to dashboard Cite

GIFT, a lightweight block cipher proposed at CHES2017, has been widely cryptanalyzed this years. This paper studies the differential diffusion characteristics of round function of GIFT at first, and proposes a random nibble-based differential fault attack. The key recovery scheme is developed on the statistical properties we found for the differential distribution table of the S-box. A lot of experiments had been done and experimental results show that one round key can be retrieved with an average of 20.24 and 44.96 fault injections for GIFT-64 and GIFT-128 respectively. Further analysis shows that a certain number of fault injections recover most key bits. So we demonstrate an improved fault attack combined with the method of exhaustive search, which shows that the master key can be recovered by performing 2 16 and 2 17 computations and injecting 31 and 32 faults on an average for GIFT-64 and GIFT-128 respectively.

show abstract

Section: Discussionmentioning

confidence: 97%

Section: Analysis and Improvementmentioning

confidence: 91%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Differential Fault Attack on GIFT

Xie

Tian

2021

Chinese J of Electronics

View full text Add to dashboard Cite

show abstract

“…Besides the SCA, the first FA against cryptographic implementation was given by Boneh et al in EUROCRYPT'97 [6]. After that, FAs against various kinds of cipher schemes were proposed including DES [7], AES [8], DBlock [9], and so on. Infection [10] is one of the most popular countermeasures to resist FA.…”

Section: Introductionmentioning

confidence: 99%

“…FA model In this paper, we mainly consider the most popular fault attack, i.e., Differential fault attack (DFA) [7], [8]. It is based on the concrete faulty output value.…”

mentioning

confidence: 99%

A Combined Countermeasure Against Side-Channel and Fault Attack with Threshold Implementation Technique

et al. 2023

Self Cite

View full text Add to dashboard Cite

Side-channel attack (SCA) and fault attack (FA) are two classical physical attacks against cryptographic implementation. In order to resist them, we present a combined countermeasure scheme which can resist both SCA and FA. The scheme combines threshold implementation and duplication-based exchange techniques. The exchange technique can confuse the fault propagation path and randomize the faulty values. The threshold implementation technique can ensure a provable security against SCA. Moreover, it can also help to resist the FA by its incomplete property and random numbers. Compared with other methods, the proposed scheme has simple structure, which can be easily implemented in hardware and result in a low implementation cost. Finally, we present a detailed design for the block cipher light encryption device (LED) and implement it. The hardware cost evaluation shows our scheme has the minimum overhead factor.

show abstract

Fault Analysis on a New Block Cipher DBlock with at Most Two Fault Injections

Cited by 2 publications

References 10 publications

Differential Fault Attack on GIFT

Differential Fault Attack on GIFT

A Combined Countermeasure Against Side-Channel and Fault Attack with Threshold Implementation Technique

Contact Info

Product

Resources

About