Differential Linear Cryptanalysis Trails for Block Ciphers using DLCT

Abstract

The size of devices has decreased as a result of rapidly developing smart technology, but neither processing power nor memory have been impacted. On these limited resource devices, it is required to adopt lightweight cryptographic protocols. Sometimes, because of resource constraints, these protocols may become highly prone to cryptographic attacks. So, to ensure the design and evaluation of provably secure cryptographic protocols, NIST introduced the lightweight cryptography standardization project. The most common techniques used to evaluate the security of block ciphers are differential, linear, and differential-linear cryptanalysis. Differential attack is a chosen plain-text attack, but linear attack is a known plain-text attack. In the differential-linear attack, the combination of differential and linear attacks was used. But there have been numerous concerns regarding the complexity of these attacks. Therefore, a relatively newer technique termed as Differential Linear Connectivity Table (DLCT) has recently been presented as a tool to address the limitations of differential-linear cryptanalysis, which require that the differential distinguisher and the linear distinguisher be independent of one another. In this research we utilized the proposed DLCT method to analyze the 25-round RECTANGLE block cipher, leveraging a 15-round differential-linear distinguisher. Furthermore, we provide the analysis of the algorithms along with the time and data complexity. We have also compared our results with state-of-the-art as well.Furthermore, we present a detailed trails algorithm that recovers the best probabilities 2−34.08, so we need approximately 235 of data for key recovery, so attack data complexity is 235