SHACAL-2~＊算法的差分故障攻击

采用基于字的随机故障模型对SHACAL-2＊算法进行差分故障攻击,理论结果和实验数据都表明以超过60%的成功概率恢复512 bit的种子密钥需要160个随机故障,以超过97%的成功概率恢复512 bit的种子密钥需要204个随机故障。SHACAL-2＊算法可以找到两个有效的差分故障位置,而SHACAL-2算法只有一个有效的差分故障位置。因此,从实施差分故障攻击的难易程度看,SHACAL-2＊算法抵抗差分故障攻击的能力弱于SHACAL-2算法。...

Full description

Saved in:
Bibliographic Details
Published in计算机应用研究 Vol. 31; no. 10; pp. 3122 - 3124
Main Author 沈璇 赵光耀 李超
Format Journal Article
LanguageChinese
Published 国防科学技术大学理学院数学与系统科学系,长沙,410073 2014
Subjects
SHACAL-2＊算法
差分故障攻击
随机故障模型
random fault model
SHACAL-2 algorithm
differential fault attack
差分故障攻击
SHACAL-2算法
随机故障模型
Online AccessGet full text
ISSN1001-3695
DOI10.3969/j.issn.1001-3695.2014.10.059

Cover

More Information
Summary:采用基于字的随机故障模型对SHACAL-2＊算法进行差分故障攻击,理论结果和实验数据都表明以超过60%的成功概率恢复512 bit的种子密钥需要160个随机故障,以超过97%的成功概率恢复512 bit的种子密钥需要204个随机故障。SHACAL-2＊算法可以找到两个有效的差分故障位置,而SHACAL-2算法只有一个有效的差分故障位置。因此,从实施差分故障攻击的难易程度看,SHACAL-2＊算法抵抗差分故障攻击的能力弱于SHACAL-2算法。
Bibliography:51-1196/TP
This paper used the technique of differential fault attack on the SHACAL- 2 ＊ based on word-oriented fault model. Both theoretical results and experimental data demonstrate that 160 random faults are needed to obtain 512 bit key with suc- cessful probability more than 60% , while 204 random faults are needed to obtain 512 bit key with successful probability more than 97%. The paper found two effective differential fault positions in the SHACAL-2＊ , while one could be found in the SHACAL-2. Therefore,according to the difficulty degree of carrying out differential fault attack, SHACAL-2＊ is weaker than SHACAL-2 in the aspect of resistance differential fault attack.
SHEN Xuan, ZHAO Guang-yao, LI Chao （ Dept. of Mathematics ＆ Systems Science, College of Science, National University of Defense Technology, Changsha 410073, China ）
random fault model ; SHACAL-2＊ algorithm ; differential fault attack
ISSN:1001-3695
DOI:10.3969/j.issn.1001-3695.2014.10.059