Differential-like cryptanalysis of a class of substitution-permutation networks

摘要

We introduce a practical differential-like attack on a class of substitution-permutation networks (SPN). Our attack is effective regardless of the key-scheduling algorithm and more efficient than classical differential cryptanalysis. In addition, it is shown that 64-bit SPNs with 8/spl times/8 s-boxes are resistant to our attack after 12 rounds.