DocumentCode
2909751
Title
Impossible Differential-Algebraic Cryptanalysis of Serpent
Author
Hu Zhihua ; Qin Zhongping ; Han haiqing
Author_Institution
Coll. of Comput., Wuhan Univ., Wuhan, China
Volume
2
fYear
2009
fDate
18-20 Nov. 2009
Firstpage
353
Lastpage
357
Abstract
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 selected plaintexts and memory space.
Keywords
cryptography; differential algebraic equations; S-box; SP network block cipher; algebraic equation; differential-linear attack; memory space; plaintexts; serpent differential-algebraic cryptanalysis; Bismuth; Computer networks; Computer security; Cryptography; Differential algebraic equations; Information security; Linear approximation; Multimedia systems; Uncertain systems; algebraic equation; impossible differential-algebraic; serpent;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia Information Networking and Security, 2009. MINES '09. International Conference on
Conference_Location
Hubei
Print_ISBN
978-0-7695-3843-3
Electronic_ISBN
978-1-4244-5068-8
Type
conf
DOI
10.1109/MINES.2009.30
Filename
5368997
Link To Document