论文部分内容阅读
修改分组密码ＩＤＥＡ轮函数中的模乘运算，得到一种新的轮函数。对基于此种新轮函数的一种迭代型分组密码进行了差分密码分析。数值试验证实ＨＤＥＡ的ＤＣ有用差分的概率均低于ＨＤＥＡ０的相应差分概率。迭代次数足够大的ＨＤＥＡ能抵抗差分密码分析攻击；在８ｂｉｔＣＰＵ环境下软件加密时，２４轮ＨＤＥＡ与８轮ＩＤＥＡ的数据加密速率相近，抗差分密码分析的能力大致相同。
Modify the modular multiplication in block IDEA round function to get a new round function. Differential cryptanalysis is performed on an iterative block cipher based on this new round function. The numerical experiments confirm that the probability of DC-useful difference of HDEA is lower than the corresponding difference probability of HDEA0. HDEA with enough iterations can resist differential cryptanalysis attacks. When software is encrypted in 8bit CPU environment, the data encryption rates of 24 rounds of HDEA and 8 rounds of IDEA are similar, and the ability to resist differential cryptanalysis is roughly the same.