Results 11 to 20 of about 169 (90)
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
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
Related-Key Impossible-Differential Attack on Reduced-Round Skinny [PDF]
At CRYPTO’16, Beierle et al. presented SKINNY, a family of lightweight tweakable block ciphers intended to compete with the NSA designs SIMON and SPECK.
Ankele, Ralph +6 more
core +2 more sources
Boomerang Connectivity Table:A New Cryptanalysis Tool [PDF]
A boomerang attack is a cryptanalysis framework that regards a block cipher $E$ as the composition of two sub-ciphers $E_1\circ E_0$ and builds a particular characteristic for $E$ with probability $p^2q^2$ by combining differential characteristics for ...
A Biryukov +21 more
core +2 more sources
Automatic Generation of Declarative Models For Differential Cryptanalysis [PDF]
When designing a new symmetric block cipher, it is necessary to evaluate its robustness against differential attacks. This is done by computing Truncated Differential Characteristics (TDCs) that provide bounds on the complexity of these attacks. TDCs are
+3 more
core +3 more sources
Clustering Related-Tweak Characteristics: Application to MANTIS-6
The TWEAKEY/STK construction is an increasingly popular approach for designing tweakable block ciphers that notably uses a linear tweakey schedule. Several recent attacks have analyzed the implications of this approach for differential cryptanalysis and ...
Maria Eichlseder, Daniel Kales
doaj +1 more source

