针对LBlock密码单轮扩散的差分故障分析  

Differential Fault Analysis on Cipher LBlock Based One-Round Diffusion

作　　者：潘晓中[1] 程璐 PAN Xiaozhong CHENG Lu(Department of Electronic Technology Postgraduate Brigade, Engineering University of PAP, Xi＇an 710086, China)

机构地区：[1]武警工程大学电子技术系,西安710086 [2]武警工程大学研究生管理大队,西安710086

出　　处：《武警工程大学学报》2016年第6期43-46,共4页Journal of Engineering University of the Chinese People＇s Armed Police Force

摘　　要：为评估轻量级密码LBlock对差分故障攻击的抵抗能力，通过对比Block算法的扩散层故障传播效率，选择针对单轮扩散的故障模型对LBlock密码进行差分故障攻击。通过对不同的S盒进行分析，成功恢复出子密钥信息。结果显示：平均93．5％的概率通过两次故障诱导成功恢复半字节的子密钥信息，98．375％的概率可以在4次以内恢复。通过攻击最后3轮可以根据密钥扩展算法恢复出主密钥全部信息，恢复最后一轮子密钥全部信息需要的故障数目为16．62；为得到主密钥全部信息，平均需要故障的数目为46．8。In order to evaluate the immunity of the cipher LBlock against differential fault a- nalysis,by comparing the diffusion layer diffuse efficiency of LBlock algorithm, choose one- round diffusion fault model to simulate the LBlock attack. Through analyzing different S-bo- xes,nibble key information could be recovered. The results show that with a probability of 93.5% one could recover nibble key information with 2 faults, and 98.2% probability with 4 faults. By attacking the last three rounds, the master key can be recovered according to key schedule. To recover the last round key information one needs 16.62 faults on average, and recover the master key information one needs 46.8 faults on average.

关 键 词：LBlock 轻量级分组密码 差分故障攻击 

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