模乘碰撞攻击的分析方法改进  

Improved Analysis Method of the Modular Multiplication Collision Attack

作　　者：陈艾东[1,2] 陈运[2] 曹娜娜[2] 

机构地区：[1]电子科技大学计算机科学与工程学院,成都611731 [2]成都信息工程学院信息安全研究所,成都610225

出　　处：《电子科技大学学报》2012年第5期684-687,共4页Journal of University of Electronic Science and Technology of China

基　　金：国家自然科学基金(60873216);四川省应用基础研究基金(2008JY0078);四川省应用基础研究基金(2011JY0100)

摘　　要：针对真实环境中用直接差分的方法寻找模乘碰撞较困难的问题,提出了一种K均值聚类算法。该算法可以自适应找出模乘碰撞。在搭建的真实攻击环境下,验证了文献[8]中的碰撞攻击在ASIC真实环境中攻击效果并不明显的结论。应用改进的方法后,一对功耗曲线样本便可恢复出88%以上的密钥,实现了小样本量曲线的RSA指数的提取。讨论了对这种攻击方法的防御方案。The simple power analysis attacks （SPA） of chosen-message contrary pairs is proposed by Miyamoto, which is an attack method based on searching the collision of modular multiplication. But in the real environment searching the collision is difficult. For this problem, the K-means clustering algorithm is proposed which can identify the modular multiplication collision automatically. The insignificant effects of collision attack are validated in the ASIC environment which suggested by Miyamoto. After the improvement method, by using a couple of power consumption curves it can recover more than 88% of the secret keys. Finally, the countermeasure of this attack method is discussed.

关 键 词：选择明文攻击 碰撞攻击 密码分析 K均值聚类 边信道攻击 

分 类 号：TN918.91[电子电信—通信与信息系统]