FIFA: A fault-injection–fault-analysis-based tool for reliability assessment at RTL level

2011 ◽  
Vol 51 (9-11) ◽  
pp. 1459-1463 ◽  
Author(s):  
L.A.B. Naviner ◽  
J.-F. Naviner ◽  
G.G. dos Santos ◽  
E.C. Marques ◽  
N.M. Paiva
Author(s):  
Jakub Breier ◽  
Xiaolu Hou ◽  
Yang Liu

Over the past decades, fault injection attacks have been extensively studied due to their capability to efficiently break cryptographic implementations. Fault injection attack models are normally determined by analyzing the cipher structure and finding exploitable spots in non-linear and permutation layers. However, this level of abstraction is often too high to distinguish vulnerable parts of software implementations, due to specific operations and optimizations. On the other hand, manually analyzing the assembly code requires non-negligible amount of time and expertise. In this paper, we propose an automated approach for analyzing cipher implementations in assembly. We represent the whole assembly program as a data flow graph so that the vulnerable spots can be found efficiently. Fault propagation is analyzed in a subgraph constructed from each vulnerable spot, allowing equations for Differential Fault Analysis (DFA) to be automatically generated. We have created a tool that implements our approach: DATAC – DFA Automation Tool for Assembly Code. We have successfully used this tool for attacking PRESENT- 80, being able to find implementation-specific vulnerabilities that can be exploited in order to recover the last round key with 16 faults. Our results show that DATAC is useful in finding attack spots that are not visible from the cipher structure, but can be easily exploited when dealing with real-world implementations.


Author(s):  
Alexander Yasko ◽  
Eugene Babeshko ◽  
Vyacheslav Kharchenko

Instrumentation and Control (I&C) systems for Nuclear Power Plants (NPP) are exceedingly complicated electronic solutions that include thousands of different components such as microcontrollers, Field-Programmable Gate Arrays (FPGAs), integrated circuits etc. Deployment of such safety-critical systems cannot be performed without complex safety and reliability assessment, verification and validation (V&V) activities that are addressed to exposing of overlooked faults. The examples of such activities are Fault Tree Analysis (FTA), Failure Modes and Effects Analysis (FMEA), Fault Injection Testing (FIT). Due to complexity of NPP I&C systems in most cases the process of assessment is very time consuming and the results mostly depend on experts’ qualification. Traditional safety and reliability assessment methods are being constantly modified and enhanced so as to comply with increasing demands of national and international standards and guidance, as well as to be applied for I&C systems that contain number of complex components like FPGA. Although much work related to analysis of FPGA-based systems has been performed, there is a lack of detailed technique for FPGA-based I&C systems failure identification that considers probability of several faults at the same time (multi-faults), development of preventive strategies for controlling or reducing of the risk related to such failures, as well as automation of this technique so as to make it utilizable for real NPP industry tasks. FIT as verification for Failure Modes, Effects and Diagnostics Analysis (FMEDA) was used during Safety Integrity Level 3 (SIL3) certification process of RadICS NPP I&C platform, while the parts of proposed technique were used as internal verification and validation activities applied on several modules of the platform.


Author(s):  
Hadi Soleimany ◽  
Nasour Bagheri ◽  
Hosein Hadipour ◽  
Prasanna Ravi ◽  
Shivam Bhasin ◽  
...  

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.


Information ◽  
2021 ◽  
Vol 12 (10) ◽  
pp. 433
Author(s):  
Kazuki Nakamura ◽  
Koji Hori ◽  
Shoichi Hirose

Cryptographic hash functions play an essential role in various aspects of cryptography, such as message authentication codes, pseudorandom number generation, digital signatures, and so on. Thus, the security of their hardware implementations is an important research topic. Hao et al. proposed an algebraic fault analysis (AFA) for the SHA-256 compression function in 2014. They showed that one could recover the whole of an unknown input of the SHA-256 compression function by injecting 65 faults and analyzing the outputs under normal and fault injection conditions. They also presented an almost universal forgery attack on HMAC-SHA-256 using this result. In our work, we conducted computer experiments for various fault-injection conditions in the AFA for the SHA-256 compression function. As a result, we found that one can recover the whole of an unknown input of the SHA-256 compression function by injecting an average of only 18 faults on average. We also conducted an AFA for the SHACAL-2 block cipher and an AFA for the SHA-256 compression function, enabling almost universal forgery of the chopMD-MAC function.


2010 ◽  
Vol 50 (2) ◽  
pp. 304-311 ◽  
Author(s):  
Oana Boncalo ◽  
Alexandru Amăricăi ◽  
Mihai Udrescu ◽  
Mircea Vlăduţiu

2021 ◽  
Author(s):  
Annachiara Ruospo ◽  
Lucas Matana Luza ◽  
Alberto Bosio ◽  
Marcello Traiola ◽  
Luigi Dilillo ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document