Differential-Linear Approximation Semi-Unconstrained Searching and Partition Tree: Application to LEA and Speck

ePrint Report: Differential-Linear Approximation Semi-Unconstrained Searching and Partition Tree: Application to LEA and Speck

Yi Chen, Zhenzhen Bao, Hongbo Yu

The differential-linear attack is one of the most effective attacks against ARX ciphers. However, two technical problems are preventing it from being more effective and having more applications: (1) there is no efficient method to search for good differential-linear approximations. Existing methods either have many constraints or are currently inefficient. (2) partitioning technique has great potential to reduce the time …

application applications attack attacks chen ciphers eprint report linear problems report technical