Results 11 to 20 of about 10,586,295 (59)
Practical Key-Recovery Attack on MANTIS5
MANTIS is a lightweight tweakable block cipher published at CRYPTO 2016. In addition to the full 14-round version, MANTIS7, the designers also propose an aggressive 10-round version, MANTIS5.
Christoph Dobraunig +3 more
doaj +2 more sources
Impossible differential cryptanalysis of lightweight tweakable block cipher CRAFT
The CRAFT cipher is a lightweight tweakable block cipher introduced at FSE 2019. Its design aims to incorporate countermeasures against Differential Fault Attacks at the algorithmic level.
Fen Liu +5 more
doaj +2 more sources
Dialga: A Family of Low-Latency Tweakable Block Ciphers Using Multiple Linear Layers
In this paper, we propose Dialga, a family of low-latency tweakable block ciphers designed to support 128/256-bit tweaks and 256-bit keys. Dialga achieves significantly small latency by leveraging multiple novel strategies.
Subhadeep Banik +7 more
doaj +2 more sources
Nonce‐misuse resilience of Romulus‐N and GIFT‐COFB
Abstract Nonce‐misuse resilience (NMRL) security of Romulus‐N and GIFT‐COFB is analysed, the two finalists of NIST Lightweight Cryptography project for standardising lightweight authenticated encryption. NMRL, introduced by Ashur et al. at CRYPTO 2017, is a relaxed security notion from a stronger, nonce‐misuse resistance notion. The authors have proved
Akiko Inoue +2 more
wiley +1 more source
Meet‐in‐the‐middle attacks on round‐reduced CRAFT based on automatic search
We construct a DS‐MITM automatic search model for CRAFT and use the automatic search model to detect a 9‐round DS‐MITM distinguisher. Based on the 9‐round distinguisher, 19/20‐round DS‐MITM attacks can be presented. Abstract CRAFT is a lightweight block cipher designed by Beierle et al.
Zhangjun Ma, Manman Li, Shaozhen Chen
wiley +1 more source
Improved Rectangle Attacks on SKINNY and CRAFT
The boomerang and rectangle attacks are adaptions of differential cryptanalysis that regard the target cipher E as a composition of two sub-ciphers, i.e., E = E1 ∘ E0, to construct a distinguisher for E with probability p2q2 by concatenating two short ...
Hosein Hadipour +2 more
doaj +1 more source
Many cryptanalytic techniques for symmetric‐key primitives rely on specific statistical analysis to extract some secrete key information from a large number of known or chosen plaintext‐ciphertext pairs. For example, there is a standard statistical model for differential cryptanalysis that determines the success probability and complexity of the attack
Caibing WANG +3 more
wiley +1 more source
Efficient constructions for large‐state block ciphers based on AES New Instructions
Abstract Large‐state block ciphers with 256 bits or 512 bits block sizes receive much attention from the viewpoint of long‐term security. Existing large‐state block ciphers, such as Haraka‐v2 and Pholkos, consist of only the AES New Instructions set (AES‐NI) and a word shuffle that can be efficiently executed by SIMD instructions for fast software ...
Rentaro Shiba +2 more
wiley +1 more source
Multiple Impossible Differential Attacks for ForkAES
To yield a highly efficient authentication encryption design for very short messages, the tweakable forkcipher is proposed, which is a tweakable block cipher that uses forking construction to produce two output blocks. The designers also presented ForkAES, a forkcipher that is based on the round function of AES and the tweakable variant of KIASU ...
Zilong Jiang, Chenhui Jin, Jin Wook Byun
wiley +1 more source
Improved meet‐in‐the‐middle attacks on reduced‐round Joltik‐BC
Abstract Joltik‐BC is an internal tweakable block cipher of the authenticated encryption algorithm Joltik, which was a second‐round finalist in the CAESAR competition. The authors study the key‐recovery attacks on Joltik‐BC under meet‐in‐the‐middle attack.
Manman Li, Shaozhen Chen
wiley +1 more source

