In this paper, we present two differential fault analyses on PRESENT-80 which is a lightweight block cipher. The first attack is a basic attack which induces a fault on only one bit of intermediate states, and we can obtain the last subkey of the block cipher, given 48 faulty cipher texts on average. The second attack can retrieve the master key of the block cipher, given 18 faulty cipher texts...

RoadRunneR is a small and fast bitslice lightweight block cipher for low cost 8-bit processors proposed by Adnan Baysal and Sähap Şahin in the LightSec 2015 conference. While most software efficient lightweight block ciphers lacking a security proof, RoadRunneR’s security is provable against differential and linear attacks. RoadRunneR is a Feistel structure block cipher with 64-bit block size. ...

Round addition differential fault analysis using operation skipping for lightweight block ciphers with on-the-fly key scheduling is presented. For 64-bit KLEIN, it is shown that only a pair of correct and faulty ciphertexts can be used to derive the secret master key. For PRESENT, one correct ciphertext and two faulty ciphertexts are required to reconstruct the secret key. Furthermore, secret k...

This article presents a latency-optimized implementation of the SIMECK lightweight block cipher on field-programmable-gate-array (FPGA) platform with and key lengths 32 64 bits. The critical features our architecture include parallelism, pipelining, dedicated controller. Parallelism splits digits data blocks into smaller segments. Then, we use each segmented in parallel for encryption decryptio...

Hummingbird is a novel ultralightweight Cryptographic Algorithm aiming at resource-constrained devices. It has a hybrid structure of block cipher and stream cipher and was developed with both lightweight software and lightweight hardware implementations for constrained devices in mind. Moreover, Hummingbird has been shown to be resistant to the most common attacks to block ciphers and stream ci...

We describe block-cipher modes of operation that turn an n-bit block cipher into a tweakable enciphering scheme that acts on sectors of mn bits, where m ≥ 2. When the underlying block cipher is secure in the sense of a strong pseudorandom permutation (PRP) our schemes are secure in the sense of variableinput-length, tweakable, strong PRP. Such an object can be used to encipher the sectors of a ...