Results 21 to 30 of about 145 (76)
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
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
Impossible Differential Cryptanalysis of Reduced-Round Tweakable TWINE [PDF]
Tweakable TWINE (T-TWINE) is a new lightweight tweakable block cipher family proposed by Sakamoto $et$ $al$. at IWSEC 2019. T-TWINE is the first Tweakable Block Cipher (TBC) that is built on Generalized Feistel Structure (GFS).
Tolba M, ElSheikh M, Youssef A.
europepmc +2 more sources
Differential Cryptanalysis on Block Cipher Skinny with MILP Program
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
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
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.
Florian Mendel +13 more
core +1 more source
Impossible Differential Cryptanalysis of 8-Round Deoxys-BC-256
Deoxys is a third-round candidate of the CAESAR authenticated encryption competition. In this paper, we present the first cryptanalysis of Deoxys in the single-key model.
Zilong Jiang, Chenhui Jin
doaj +1 more source

