论文部分内容阅读
PRINCE是Borgho等学者于2012年提出的低延时轻量级密码算法,轻量级密码算法的自身安全性一直是研究热点.研究PRINCE算法代数攻击安全问题,提出用Mathematica软件列出S盒的方程,将其表示为单项式个数较少的无冗余等效方程组,将PRINCE的S盒表示为由8个单项式个数均小于等于5的8元布尔方程构成的等效方程组,并基于不同的已知明文量,利用CryptoMiniSAT2.9.6软件对PRINCE进行代数攻击实验.实验结果表明,在已知明文条件下可以求出5轮PRINCE的全部密钥位,在选择明文条件下可以求出6轮PRINCE的全部密钥比特.相关研究结果可以给PRINCE密码算法的优化提供一定参考.
PRINCE is a low-latency lightweight encryption algorithm proposed by Borgho and other scholars in 2012. The lightweight security of the lightweight encryption algorithm has always been a research hotspot.Studying the algebraic security of PRINCE algorithm, we propose to use Mathematica software to list the S-boxes Equation, which is represented as a non-redundant equivalent system with a small number of monomials, an S-box of PRINCE as an equivalent system of equations consisting of 8-element Boolean equations with 8 monomials each less than or equal to 5 and CryptoMiniSAT2.9.6 based on different known plaintexts is used to test the algebraic attack on PRINCE.The experimental results show that all the key bits of 5 PRINCEs can be obtained under the condition of known plaintext, 6 rounds PRINCE all the key bits.Related research results can give PRINCE cipher algorithm optimization provide some reference.