Abstract: Aiming at the differential fault attack of PRESENT cipher algorithm, the differential fault propagation characteristics of PRESENT algorithm are analyzed and the import fault locations are optimized in this paper. On this base, different attack models for quickly obtaining the original cipher are established by using combination exhaustive search. The encryption process and attack process of PRESENT algorithm are implemented by using C++. The results reveal that there are two factors that affect the differential fault attack of PRESENT, the number of attack and the number of fault ciphertext. In the last second round attack, an average of 30 pieces of fault ciphertext are required to restore 64bit round key, while an average of only 9 pieces of fault ciphertexts are necessary to restore all keys in preceding rounds. Meanwhile, the attack complexity of this attack method of single fault cipher is 2²⁶, while the key search complexity is 2³¹.