Results 1 to 10 of about 372 (92)
Improved related‐tweakey rectangle attacks on round‐reduced Deoxys‐BC
IET Information Security, 2023 Deoxys‐BC is the internal tweakable block cipher of the authenticated encryption (AE) Deoxys family, in which Deoxys‐II is the primary choice for the use case of ‘Defence in depth’ among the portfolio of CAESAR competition.
Jiamei Liu, Lin Tan, Hong Xu
doaj +4 more sources
New Related-Tweakey Boomerang and Rectangle Attacks on Deoxys-BC Including BDT Effect [PDF]
IACR Transactions on Symmetric Cryptology, 2019 In the CAESAR competition, Deoxys-I and Deoxys-II are two important authenticated encryption schemes submitted by Jean et al. Recently, Deoxys-II together with Ascon, ACORN, AEGIS-128, OCB and COLM have been selected as the final CAESAR portfolio ...
Boxin Zhao, Xiaoyang Dong, Keting Jia
doaj +6 more sources
Security Analysis of SKINNY under Related-Tweakey Settings [PDF]
IACR Transactions on Symmetric Cryptology, 2017 In CRYPTO’16, a new family of tweakable lightweight block ciphers - SKINNY was introduced. Denoting the variants of SKINNY as SKINNY-n-t, where n represents the block size and t represents the tweakey length, the design specifies t ∈ {n, 2n, 3n}. In this
Guozhen Liu, Mohona Ghosh, Ling Song
doaj +6 more sources
MILP-Aided Related-Tweak/Key Impossible Differential Attack and its Applications to QARMA, Joltik-BC [PDF]
IEEE Access, 2019 In this paper, we study the relation of related-tweak/key impossible differentials with single-key ones. Following a heuristic strategy, we can derive longer related-tweak/key impossible differentials from single-key ones. We implement this strategy with
Rui Zong, Xiaoyang Dong
doaj +5 more sources
Zero-Correlation Attacks on Tweakable Block Ciphers with Linear Tweakey Expansion [PDF]
IACR Transactions on Symmetric Cryptology, 2019 The design and analysis of dedicated tweakable block ciphers is a quite recent and very active research field that provides an ongoing stream of new insights.
Ralph Ankele +5 more
doaj +5 more sources
Tweaks and Keys for Block Ciphers: The TWEAKEY Framework [PDF]
Lecture Notes in Computer Science, 2014 We propose the TWEAKEY framework with goal to unify the design of tweakable block ciphers and of block ciphers resistant to related-key attacks. Our framework is simple, extends the key-alternating construction, and allows to build a primitive with arbitrary tweak and key sizes, given the public round permutation (for instance, the AES round ...
Ivica Nikolic, Thomas Peyrin
exaly +2 more sources
On Large Tweaks in Tweakable Even-Mansour with Linear Tweak and Key Mixing
IACR Transactions on Symmetric Cryptology, 2023 In this paper, we provide the first analysis of the Iterated Tweakable Even-Mansour cipher with linear tweak and key (or tweakey) mixing, henceforth referred as TEML, for an arbitrary tweak(ey) size kn for all k ≥ 1, and arbitrary number of rounds r ≥ 2.
Benoît Cogliati +3 more
doaj +1 more source
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 +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
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 +3 more
wiley +1 more source