The Substitution-Permutation Network (SPN) is a main type of structure in block ciphers. This paper proposes a new and practical differential fault attack technique on SPN structure. As an instance of SPN cipher, AES-256 can be recovered by 4 faulty ciphertexts. Compared with the previous techniques, our work can recover all subkeys of an SPN cipher with all key sizes. Therefore, our attacking ...

Fault attacks described in cryptographic papers mostly apply to cryptographic algorithms‚ yet such attacks may have an impact on the whole system in a smart card. In this paper‚ we describe what can be achieved nowadays by using fault attacks in a smart card environment. After studying several ways of inducing faults‚ we describe attacks on the most popular cryptosystems and we discuss the prob...

Random delays are commonly used as a countermeasure to inhibit side channel analysis and fault attacks in embedded devices. This paper proposes a different manner of generating random delays. The alternative proposed increases the desynchronisation compared to uniformly distributed random delays. It is also shown that it is possible to reduce the amount of time lost due to random delays, while ...

Elliptic Curve Cryptography implementations are known to be vulnerable to various side-channel attacks and fault injection attacks, and many countermeasures have been proposed. However, selecting and integrating a set of countermeasures targeting multiple attacks into an ECC design is far from trivial. Security, performance and cost need to be considered together. In this paper, we describe a g...

Since sensor applications are implemented in embedded computer systems, cyber attacks that compromise regular computer systems via exploiting memory-related vulnerabilities present similar threats to sensor networks. However, the paper shows that memory fault attacks in sensors are not the same as in regular computers due to sensor’s hardware and software architecture. In contrast to worm attac...

Security-aware embedded devices which are likely to operate in hostile environments need protection against physical attacks. For the RSA public-key algorithm, protected versions of the Montgomery powering ladder have gained popularity as countermeasures for such attacks. In this paper, we present a general fault attack against RSA implementations which use the Montgomery powering ladder. In a ...

In this paper we study a novel computational problem called the Hidden Root Problem, which appears naturally when considering fault attacks on pairing based cryptosystems. Furthermore, a variant of this problem is one of the main obstacles for efficient pairing inversion. We present an algorithm to solve this problem over extension fields and investigate for which parameters the algorithm becom...

In this article, we propose a new method to protect block cipher implementations against Differential Fault Attacks (DFA). Our strategy, so-called “Tweak-in-Plaintext”, ensures that an uncontrolled value (‘tweak-in’) is inserted into some part of the block cipher plaintext, thus effectively rendering DFA much harder to perform. Our method is extremely simple yet presents many advantages when co...

Abstract. PRIDE is one of the most efficient lightweight block cipher proposed so far for connected objects with high performance and lowresource constraints. In this paper we describe the first ever complete Differential Fault Analysis against PRIDE. We describe how fault attacks can be used against implementations of PRIDE to recover the entire encryption key. Our attack has been validated fi...

The study of countermeasures for hardware fault attack in multi-prime RSA cryptosystems is very important for applications such as computer network and smart cards. In this paper, an efficient countermeasure method is proposed for the FPGA-based multi-prime RSA systems. The proposed method can survive the attacks [27, 30] that broke the previous methods [5, 33]. Furthermore, by using a simple o...