11-Round Impossible Differential Algebraic Attack for Serpent Encryption Algorithm

摘要

This paper explored algebraic features of nonlinear parts in Serpent encryption algorithm and offered an 11-round Serpent-128 impossible differential algebraic attack through utilizing the method in constructing S-box algebraic equations. The new method analyzed block 11-round Serpent with 2127 selected plaintexts and 2129 bytes memory space at the same time of giving a new design principle of S-box anti-algebraic attack.