摘要
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 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.
出处
《数学的实践与认识》
北大核心
2015年第5期153-159,共7页
Mathematics in Practice and Theory
基金
国家自然科学基金(61173036)
湖南省自然科学基金(2015JJ4011)
湖南省十二五重点建设学科
湖南省大学生研究性学习和创新性实验计划项目(2014366)
衡阳师范学院大学生研究性学习和创新性实验计划项目(CX1417)
聚落文化遗产数字化技术与应用湖南省重点实验室开放基金(J1401Z)
衡阳师范学院产学研基金项目(12CXYZ01)
湖南省普通高校教学改革研究项目(湘教通(2014)247号2014382)
