Parity Check Based Fault Detection against Timing Fault Injection Attacks

نویسندگان

چکیده

Fault injection technologies can be utilized to steal secret information inside integrated circuits (ICs), and thus cause serious security threats. Parity check has been adopted as an efficient method against fault attacks. However, the contradiction between overhead restricts further development applications of parity in detection. This paper proposes two methods, mixed-grained word recombination check, based on for trade-off overhead. The efficiency proposed approaches is verified RC5, AES, DES encryption implementations by clock glitch attack. Compared with traditional coverage rate approach increased up 53.69% consuming 13.2% registers more. Against 47.16% using only 2.35% register provide IC designers countermeasure options targeting different design skills specifications.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Protecting Elliptic Curve Cryptography Against Fault Injection Attacks

Context. A fault injection attack consists in modifying an intermediate value of a computation (using an electromagnetic pulse or by acting on the power supply of the circuit) and exploiting the faulted final result to gather information about the computation that would not be accessible in a correct final result. For instance, did you know that due to the simplicity of the arithmetic behind RS...

متن کامل

Automatic Integration of Counter-Measures Against Fault Injection Attacks

This paper describes a technology aiming at enforcing semiautomatically counter-measures against fault injection attacks of smart cards. This technology addresses in a generic way the whole software embedded on the card. In particular, it addresses threats going beyond cryptography-related parts of the embedded software, like threats against the firewall of the Java Card embedded virtual machin...

متن کامل

Fault Attacks Against emv Signatures

At ches 2009, Coron, Joux, Kizhvatov, Naccache and Paillier (cjknp) exhibited a fault attack against rsa signatures with partially known messages. This attack allows factoring the public modulus N . While the size of the unknown message part (ump) increases with the number of faulty signatures available, the complexity of cjknp’s attack increases exponentially with the number of faulty signatur...

متن کامل

Study of a Parity Check Based Fault-Detection Countermeasure for the AES Key Schedule

In this paper we study a parity check based countermeasure proposed by Chen et al. that thwarts their attack by detecting byte fault injection during the AES key schedule process. We provide a generalization of their approach that allows to derive parity equations for every AES sizes not given by the authors. We analyze why Chen et al. countermeasure does not properly works. Doing so we are abl...

متن کامل

Fault-Tolerance of ”Bad” Quantum Low-Density Parity Check Codes

Quantum low-density parity check (LDPC) codes such as generalized toric codes with finite rate suggested by Tillich and Zémor offer an alternative route for quantum computation. Here, we study LDPC codes and show that any family of LDPC codes, quantum or classical, where distance scales as a positive power of the block length, has a finite error threshold. Based on that, we conclude that quantu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2022

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics11244082