An Attack against DES Based on the Relationship L_{i+1}=R_{i}

We put forward a new attack against DES based on the inner relationship L_i+1 = R_i. The attack requires about 2¹⁶ ciphertexts of the same R₁₆, encrypted by the same key K. This attack has a complexity of 2⁵⁵. But from a practical point of view, the requirement for the new attack is more applicable than Differential cryptanalysis, Linear cryptanalysis or Davies´ attack.