Sep 24, 2023 � We propose a novel idea for generating new good differential-linear approximations from known ones, based on which new searching algorithms are designed.
Dec 18, 2023 � We propose a novel idea for generating new good differential-linear approximations from known ones, based on which new searching algorithms are designed.
In this work, we step forward in solving the two problems. First, we propose a novel idea for generating new good differential-linear approximations from known�...
Differential-Linear Approximation Semi-unconstrained Searching and Partition Tree: Application to LEA and Speck. https://doi.org/10.1007/978-981-99-8727-6_8�...
Differential-Linear Approximation Semi-Unconstrained Searching and Partition Tree: Application to LEA and Speck 29th Annual International Conference on the�...
Differential-Linear Approximation Semi-unconstrained Searching and Partition Tree: Application to LEA and Speck. 2023 | Book chapter.
Dec 17, 2023 � Differential-Linear Approximation Semi-unconstrained Searching and Partition Tree: Application to LEA and Speck. Yi Chen, Zhenzhen Bao�...
Dec 4, 2023 � The LEA algorithm is a lightweight block cipher that processes data blocks of 128-bits and has three different key lengths, each with a different number of�...
May 14, 2024 � Consequently, we present the improved differential-linear distinguishers for SPECK32 and LEA, along with the 18-round attacks on LEA192 and�...
Differential-Linear Approximation Semi-unconstrained Searching and Partition Tree: Application to LEA and Speck. Advances in Cryptology—ASIACRYPT 2023�...