Results 21 to 30 of about 423 (100)

Nonce‐misuse resilience of Romulus‐N and GIFT‐COFB

IET Information Security, Volume 17, Issue 3, Page 468-484, May 2023., 2023
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, Chun Guo, Kazuhiko Minematsu   +2 more
wiley   +1 more source

Meet‐in‐the‐middle attacks on round‐reduced CRAFT based on automatic search

IET Information Security, Volume 17, Issue 3, Page 534-543, May 2023., 2023
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

Statistical Model on CRAFT

Chinese Journal of Electronics, Volume 31, Issue 4, Page 698-712, July 2022., 2022
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, Hao GUO, Dingfeng YE, Ping WANG   +3 more
wiley   +1 more source

Efficient constructions for large‐state block ciphers based on AES New Instructions

IET Information Security, Volume 16, Issue 3, Page 145-160, May 2022., 2022
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, Kosei Sakamoto, Takanori Isobe   +2 more
wiley   +1 more source

Multiple Impossible Differential Attacks for ForkAES

Security and Communication Networks, Volume 2022, Issue 1, 2022., 2022
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

IET Information Security, Volume 15, Issue 3, Page 247-255, May 2021., 2021
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

Automated Search Oriented to Key Recovery on Ciphers with Linear Key Schedule [PDF]

, 2021
Automatic modelling to search distinguishers with high probability covering as many rounds as possible, such as MILP, SAT/SMT, CP models, has become a very popular cryptanalysis topic today.
Keting Jia, Lingyue Qin, Xiaoyang Dong, Xiaoyun Wang, Yunwen Liu   +4 more
core   +2 more sources

Boomerang Connectivity Table:A New Cryptanalysis Tool [PDF]

, 2018
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, A Biryukov, A Bogdanov, A Canteaut, C Beierle, C Cid, D Wagner, E Biham, E Biham, E Biham, E Biham, G Liu, J Guo, J Jean, J Kelsey, J Kim, K Aoki, O Dunkelman, O Dunkelman, S Murphy, T Suzaki, TP Berger   +21 more
core   +2 more sources

Cryptanalysis of SKINNY in the Framework of the SKINNY 2018--2019 Cryptanalysis Competition [PDF]

, 2019
In April 2018, Beierle et al. launched the 3rd SKINNY cryptanalysis competition, a contest that aimed at motivating the analysis of their recent tweakable block cipher SKINNY . In contrary to the previous editions, the focus was made on practical attacks:
Christof Beierle, G Liu, J Jean, LR Knudsen, Patrick Derbez, R Ankele, X Lai   +6 more
core   +3 more sources

Efficient and Provable White-Box Primitives [PDF]

, 2016
International audienceIn recent years there have been several attempts to build white-box block ciphers whose implementations aim to be incompress-ible.
A Biryukov, B Barak, B Barak, B Minaud, B Wyseur, C Costello, C Delerablée, D Cash, DR Stinson, H Gilbert, H Krawczyk, J Alwen, J Daemen, J Jean, J Zimmerman, J-P Aumasson, J-S Coron, J-S Coron, L Goubin, M Bellare, O Billet, R Shaltiel, S Boucheron, S Chow, S Chow, S Dziembowski, SP Vadhan, Y Mulder   +27 more
core   +5 more sources