Hosein Hadipour
Graz University of Technology, Graz

Hadi Soleimany
Shahid Beheshti University, Tehran, Iran

Nasour Bagheri
Shahid Rajaee Teacher Training University, Tehran, Iran

Prasanna Ravi
Temasek Laboratories, NTU, Singapore

Shivam Bhasin
Temasek Laboratories, NTU, Singapore

Sara Mansouri
Shahid Beheshti University, Tehran, Iran

Keywords: Fault Attack, Persistent Fault Analysis, Multiple Faults, AES

Abstract

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 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