摘要
Klein算法是一个基于SP型结构的轻量级分组密码算法,具有执行效率高、能耗低等特点。通过分析算法S盒差分传播途径,发现在相同输入、不同差分条件下,输出差分对应中间状态集合交集元素唯一,提出差分故障攻击方案。通过在算法最后一轮注入2次不同故障,可恢复出Klein算法的全部密钥,复杂度可忽略不计。此方法可推广到基于SP结构和Feistel结构分组密码算法。
As a lightweight block cipher algorithm based on SP structure, Klien has the characteristics of high efficiency and low energy consumption. By analyzing the S-boxes differential propagation path, it was found that under the condition of same input and different difference, the intersection elements were unique, which fall in the intermediate state set corresponds to output difference, and a differential fault attack scheme was proposed. By injecting two different faults in the last round of the algorithm, all the keys of the Klein algorithm can be recovered, and the complexity is negligible. This method can be promoted to other block cipher algorithms based on SP structure and Feistel structure.
出处
《通信学报》
EI
CSCD
北大核心
2016年第S1期111-115,共5页
Journal on Communications
关键词
分组密码
S盒
差分传播
差分故障
block cipher
S-box
differential transmission
differential fault