Practical Multiple Persistent Faults Analysis

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

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Hadi Soleimany, Nasour Bagheri, Hosein Hadipour, Prasanna Ravi, Shivam Bhasin, Sara Mansouri
Formato:	article
Lenguaje:	EN
Publicado:	Ruhr-Universität Bochum 2021
Materias:	Fault Attack Persistent Fault Analysis Multiple Faults AES Computer engineering. Computer hardware TK7885-7895 Information technology T58.5-58.64
Acceso en línea:	https://doaj.org/article/9dc2097cbaab480a8290d3b732336ede
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:9dc2097cbaab480a8290d3b732336ede
record_format	dspace
spelling	oai:doaj.org-article:9dc2097cbaab480a8290d3b732336ede2021-11-19T14:36:10ZPractical Multiple Persistent Faults Analysis10.46586/tches.v2022.i1.367-3902569-2925https://doaj.org/article/9dc2097cbaab480a8290d3b732336ede2021-11-01T00:00:00Zhttps://tches.iacr.org/index.php/TCHES/article/view/9301https://doaj.org/toc/2569-2925 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. Hadi SoleimanyNasour BagheriHosein HadipourPrasanna RaviShivam BhasinSara MansouriRuhr-Universität BochumarticleFault AttackPersistent Fault AnalysisMultiple FaultsAESComputer engineering. Computer hardwareTK7885-7895Information technologyT58.5-58.64ENTransactions on Cryptographic Hardware and Embedded Systems, Vol 2022, Iss 1 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Fault Attack Persistent Fault Analysis Multiple Faults AES Computer engineering. Computer hardware TK7885-7895 Information technology T58.5-58.64
spellingShingle	Fault Attack Persistent Fault Analysis Multiple Faults AES Computer engineering. Computer hardware TK7885-7895 Information technology T58.5-58.64 Hadi Soleimany Nasour Bagheri Hosein Hadipour Prasanna Ravi Shivam Bhasin Sara Mansouri Practical Multiple Persistent Faults Analysis
description	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.
format	article
author	Hadi Soleimany Nasour Bagheri Hosein Hadipour Prasanna Ravi Shivam Bhasin Sara Mansouri
author_facet	Hadi Soleimany Nasour Bagheri Hosein Hadipour Prasanna Ravi Shivam Bhasin Sara Mansouri
author_sort	Hadi Soleimany
title	Practical Multiple Persistent Faults Analysis
title_short	Practical Multiple Persistent Faults Analysis
title_full	Practical Multiple Persistent Faults Analysis
title_fullStr	Practical Multiple Persistent Faults Analysis
title_full_unstemmed	Practical Multiple Persistent Faults Analysis
title_sort	practical multiple persistent faults analysis
publisher	Ruhr-Universität Bochum
publishDate	2021
url	https://doaj.org/article/9dc2097cbaab480a8290d3b732336ede
work_keys_str_mv	AT hadisoleimany practicalmultiplepersistentfaultsanalysis AT nasourbagheri practicalmultiplepersistentfaultsanalysis AT hoseinhadipour practicalmultiplepersistentfaultsanalysis AT prasannaravi practicalmultiplepersistentfaultsanalysis AT shivambhasin practicalmultiplepersistentfaultsanalysis AT saramansouri practicalmultiplepersistentfaultsanalysis
_version_	1718420086709026816

Practical Multiple Persistent Faults Analysis

Ejemplares similares