Algebraic attack on PRESENT cipher
针对PRESENT分组密码算法的代数分析*

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.