Results 11 to 20 of about 77 (49)
Improved Rectangle Attacks on SKINNY and CRAFT
IACR Transactions on Symmetric Cryptology, 2021 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
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 +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
Cryptanalysis of Reduced round SKINNY Block Cipher
IACR Transactions on Symmetric Cryptology, 2018 SKINNY is a family of lightweight tweakable block ciphers designed to have the smallest hardware footprint. In this paper, we present zero-correlation linear approximations and the related-tweakey impossible differential characteristics for different ...
Sadegh Sadeghi +2 more
doaj +1 more source
Clustering Related-Tweak Characteristics: Application to MANTIS-6
IACR Transactions on Symmetric Cryptology, 2018 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
A Security Analysis of Deoxys and its Internal Tweakable Block Ciphers
IACR Transactions on Symmetric Cryptology, 2017 In this article, we provide the first independent security analysis of Deoxys, a third-round authenticated encryption candidate of the CAESAR competition, and its internal tweakable block ciphers Deoxys-BC-256 and Deoxys-BC-384.
Carlos Cid +4 more
doaj +1 more source
Practical Key-Recovery Attack on MANTIS5
IACR Transactions on Symmetric Cryptology, 2017 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 +1 more source
Differential Cryptanalysis on Block Cipher Skinny with MILP Program
Security and Communication Networks, Volume 2018, Issue 1, 2018., 2018 With the widespread use of RFID technology and the rapid development of Internet of Things, the research of lightweight block cipher has become one of the hot issues in cryptography research. In recent years, lightweight block ciphers have emerged and are widely used, and their security is also crucial.
Pei Zhang, Wenying Zhang, Zhaoqing Pan
wiley +1 more source
Analysis of AES, SKINNY, and Others with Constraint Programming
IACR Transactions on Symmetric Cryptology, 2017 Search for different types of distinguishers are common tasks in symmetrickey cryptanalysis. In this work, we employ the constraint programming (CP) technique to tackle such problems.
Siwei Sun +6 more
doaj +1 more source