%0 Journal Article %T Algebraic attack on PRESENT cipher
针对PRESENT分组密码算法的代数分析* %A GE Shi-jing %A GU Da-wu %A LIU Zhi-qiang %A LIU Ya %A
葛十景 %A 谷大武 %A 刘志强 %A 刘亚 %J 计算机应用研究 %D 2011 %I %X This paper studies algebraic attack of PRESENT cipher. A new method was given to generate equations for PRESENT. Then this method was generalized for typical SPN cipher with small SBOX. In the experiment, reduced round PRESENT is attacked by MiniSAT. We can recover keys of 4-round PRESENT in a minute. And it cost hours to recover keys of 6-round PRESEN. By introducing difference, the attack will be more effective. It can recover keys of 8-rounds PRESEN in reasonable time. %K algebraic attack %K PRESENT %K S-box %K SAT %K SAT solver software %K block cipher
代数分析,PRESENT算法,S盒,可满足问题, %K MiniSAT,分组密码 %U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=7A182C80685884CA1978ABFF2A215A5C&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=94C357A881DFC066&sid=41092F8E82939C3E&eid=27DC88857EA57257&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=23