differential fault analysis on hight

Abstract

对HIGHT进行了差分故障攻击。攻击采用单字节级的差分故障模型,在倒数第3轮和倒数第4轮进行故障诱导来恢复密钥。模拟实验结果显示采用大约32次故 障诱导便可恢复密钥,分析的计算复杂度约为2~(56)。模加差分表预计算的复杂度为2~(32)。In this paper,we present differential fault analysis on HIGHT with a single byte fault model.We inject the fault at the third and fourth rounds from bottom.The 128-bit user key can be obtained by using 32 faulty ciphertexts with a computational complexity of 2~(56).The pre-computed complexity is 2~(32)

    Similar works