Algebraic Attack on Low-round PRESENT

This paper studies the methods of algebraic attack on PRESENT with the help of MiniSAT 2.0. It also analyzes the S-box of PRESENT and finds fourteen equivalent implicit functions of the S-box, which includes no redundancy functions and the number of normal expressions of each function is no more than six. Using different number of plaintexts, it does algebraic attack on low-round PRESENT, and the result is the best one at present. Result shows that if knowing plaintexts, it can recover the keys of five-round PRESENT using 80 bit keys in less than 121 h and if knowing the selective plaintexts, it also recovers the keys of six-round PRESENT in less than 203 h.