计算机应用研究2011，Vol.28Issue(5)：1889-1893,5.DOI:10.3969/j.issn.1001-3695.2011.05.084
针对PRESENT分组密码算法的代数分析
Algebraic attack on PRESENT cipher
摘要
Abstract
This paper studied algebraic attack of PRESENT cipher. Given a new method to generate equations for PRESENT.Then generalized this method for typical SPN cipher with small S-box. In the experiment, reduced round PRESENT was attacked by MiniSAT. It could 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 would be more effective. It could recover keys of 8-rounds PRESEN in reasonable time.关键词
代数分析/PRESENT算法/S盒/可满足问题/可满足问题求解软件/分组密码Key words
algebraic attack/ PRESENT/ S-box/ SAT/ SAT solver software/ block cipher分类
信息技术与安全科学引用本文复制引用
葛十景,谷大武,刘志强,刘亚..针对PRESENT分组密码算法的代数分析[J].计算机应用研究,2011,28(5):1889-1893,5.基金项目
国家教育部高校博士点基金资助项目(200802480019) （200802480019）
