Impossible Differential-Algebraic cryptanalysis of Serpent
Serpent is an SP Network block cipher submitted to the AES competition and chosen as one of its five finalists. The security of Serpent is widely acknowledged, especially as the best known attack so far is a differential-linear attack on only 11 rounds out of the 32 rounds of the cipher. This paper proposed impossible differential-algebraic cryptanalysis of 11-round Serpent using the key arrangement scheme of Serpent as well as the attack principle of impossible differential analysis, according to the algebraic equation of S-box. The new method analyzed block 11-round Serpent with 2127.5 selected plaintexts and 2129 memory space.
impossible differential-algebraic serpent algebraic equation
Hu Zhihua Qin Zhongping Han Haiqing
College of Computer, Wuhan University, Wuhan, Hubei,430079, China Institute of Uncertain Systems, Co College of Computer, Wuhan University, Wuhan, Hubei,430079, China
国际会议
武汉
英文
1025-1029
2009-11-18（万方平台首次上网日期，不代表论文的发表时间）