首页 | 本学科首页   官方微博 | 高级检索  
     检索      


11-Round impossible differential algebraic attack for serpent encryption algorithm
Authors:Zhihua Hu  Zhongping Qin
Institution:1.School of Computer,Wuhan University,Wuhan,Hubei, China;2.College of Mathematical and Information Sciences,Huanggang Normal University,Huanggang,Hubei, China;3.School of Software Engineering,Huazhong University of Science and Technology,Wuhan,Hubei, China
Abstract: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.
Keywords:
本文献已被 CNKI SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号