Persistent Fault Analysis with Few Encryptions

Carré, Sébastien; Guilley, Sylvain; Rioul, Olivier

doi:10.1007/978-3-030-68773-1_1

Cited by 6 publications

(3 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, using the techniques of [15,18] we further refine this inequality for finite support distributions allowing us to increase the multiplicative constant depending on the smallest probability p n . Finally, then, we apply our results in the context of side-channel attacks, where guessing entropy is a key metric [20][21][22], showing that our results provide an improvement (tighter bounds) over the method of Choudary and Popescu [12], which is known as the most scalable full-key security evaluation method to date.…”

Section: Preliminariesmentioning

confidence: 84%

Tight and Scalable Side-Channel Attack Evaluations through Asymptotically Optimal Massey-like Inequalities on Guessing Entropy

Tănăsescu

Choudary

Rioul

et al. 2021

Entropy

Self Cite

View full text Add to dashboard Cite

The bounds presented at CHES 2017 based on Massey’s guessing entropy represent the most scalable side-channel security evaluation method to date. In this paper, we present an improvement of this method, by determining the asymptotically optimal Massey-like inequality and then further refining it for finite support distributions. The impact of these results is highlighted for side-channel attack evaluations, demonstrating the improvements over the CHES 2017 bounds.

show abstract

Section: Preliminariesmentioning

confidence: 84%

Tight and Scalable Side-Channel Attack Evaluations through Asymptotically Optimal Massey-like Inequalities on Guessing Entropy

Tănăsescu

Choudary

Rioul

et al. 2021

Entropy

Self Cite

View full text Add to dashboard Cite

show abstract

“…Gruber et al applied the PFA to authenticated encryption schemes such as Deoxys-II, OCB, and COLM [GPT19]. In [CGR20], the authors meliorated the PFA by using several steps such as estimation theory, rank, and key combination algorithms. Very recently, Xu et al proposed Enhanced PFA (EPFA) [XZY + 21] which is more a key recovery approach in the single fault model.…”

Section: Related Workmentioning

confidence: 99%

Practical Multiple Persistent Faults Analysis

Soleimany

Bagheri

Hadipour

et al. 2021

TCHES

View full text Add to dashboard Cite

We focus on the multiple persistent faults analysis in this paper to fill existing gaps in its application in a variety of scenarios. Our major contributions are twofold. First, we propose a novel technique to apply persistent fault apply in the multiple persistent faults setting that decreases the number of survived keys and the required data. We demonstrate that by utilizing 1509 and 1448 ciphertexts, the number of survived keys after performing persistent fault analysis on AES in the presence of eight and sixteen faults can be reduced to only 29 candidates, whereas the best known attacks need 2008 and 1643 ciphertexts, respectively, with a time complexity of 250. Second, we develop generalized frameworks for retrieving the key in the ciphertext-only model. Our methods for both performing persistent fault attacks and key-recovery processes are highly flexible and provide a general trade-off between the number of required ciphertexts and the time complexity. To break AES with 16 persistent faults in the Sbox, our experiments show that the number of required ciphertexts can be decreased to 477 while the attack is still practical with respect to the time complexity. To confirm the accuracy of our methods, we performed several simulations as well as experimental validations on the ARM Cortex-M4 microcontroller with electromagnetic fault injection on AES and LED, which are two well-known block ciphers to validate the types of faults and the distribution of the number of faults in practice.

show abstract

“…The current common analysis methods for persistent fault [ 12 , 13 ] are mainly classical persistent fault analysis (PFA) [ 14 , 15 ], enhanced persistent fault analysis (EPFA) [ 16 ], and persistent fault-Based collision analysis (PFCA) [ 17 ]. For the SKINNY block cipher, classical persistent fault analysis cannot recovery the master key.…”

Section: Introductionmentioning

confidence: 99%

Algebraic Persistent Fault Analysis of SKINNY_64 Based on S_Box Decomposition

Fang

Wang

Yan

et al. 2022

Entropy

View full text Add to dashboard Cite

Algebraic persistent fault analysis (APFA), which combines algebraic analysis with persistent fault attacks, brings new challenges to the security of lightweight block ciphers and has received widespread attention since its introduction. Threshold Implementation (TI) is one of the most widely used countermeasures for side channel attacks. Inspired by this method, the SKINNY block cipher adopts the S_box decomposition to reduce the number of variables in the set of algebraic equations and the number of Conjunctive Normal Form (CNF) equations in this paper, thus speeding up the algebraic persistent fault analysis and reducing the number of fault ciphertexts. In our study, we firstly establish algebraic equations for full-round faulty encryption,and then analyze the relationship between the number of fault ciphertexts required and the solving time in different scenarios (decomposed S_boxes and original S_box). By comparing the two sets of experimental results, the success rate and the efficiency of the attack are greatly improved by using S_box decomposition. In this paper, We can recover the master key in a minimum of 2000s using 11 pairs of plaintext and fault ciphertext, while the key recovery cannot be done in effective time using the original S_box expression equations. At the same time, we apply S_box decomposition to another kind of algebraic persistent fault analysis, and the experimental results show that using S_box decomposition can effectively reduce the solving time and solving success rate under the same conditions.

show abstract

Persistent Fault Analysis with Few Encryptions

Cited by 6 publications

References 21 publications

Tight and Scalable Side-Channel Attack Evaluations through Asymptotically Optimal Massey-like Inequalities on Guessing Entropy

Tight and Scalable Side-Channel Attack Evaluations through Asymptotically Optimal Massey-like Inequalities on Guessing Entropy

Practical Multiple Persistent Faults Analysis

Algebraic Persistent Fault Analysis of SKINNY_64 Based on S_Box Decomposition

Contact Info

Product

Resources

About