Research on the PRINCE Algebraic Attack
Lan Li · Shuxue de shijian yu renshi · 2015
PRINCE is a low-latency lightweight cryptographic algorithm which is proposed by the Borgho in 2012.The Security of lightweight cryptographic algorithm itself has been a hotspot issue.Algebraic attacks on PRINCE algorithm are studied.The S-box equation is constructed by Mathematica.A number of smaller monomials equivalent non-redundant equations is expressed.S-boxes of PRINCE are expressed 8 equivalent equations of 8 Boolean equations which the monomials Quantities are below or equal to 5.Experiment of Algebraic attack PRINCE is used CryptoMiniSAT2.9.6.Experimental results show that all the key bits of 5-round PRINCE can be obtained based on the differential known plaintext.All the key bits of 6-round PRINCE can be successful attacked under the chosen plaintext.Research results can provide a reference for the PRINCE optimization.