摘要
PRESENT密码是一种适用于传感器网络、RFID标签等小规模硬件的轻量加密算法。本文对PRESENT算法的差分错误分析方法进行研究,提出了针对PRESENT密码的四种差分错误模型,并对它们进行分析对比,从而找到针对PRESENT算法最好的差分错误分析方法。就我们收集到的现有发表著作显示,此次研究比以往PRESENT的差分错误攻击更为有效。最好结果是,在第28轮和第29轮P置换之间引入8bit随机错误,平均使用17个错误样本分析得到最后一轮64bit白化密钥。
PRESENT is an ultra-lightweight block cipher which is suitable for lightweight hardware such as the RFID tags and sensor networks. In this paper, the strength of PRESENT against the differ ential fault analysis is explored. We present four kinds of fault models of differential fault analysis on PRESENT. Comparing these methods, we come up with the best method to analyse PRESENT using differential fault analysis. Up to now, our method is proved to be more efficient than the existing differential fault analysis on DFA in the published papers. The best result is, by introducing a 8 bit random error between the 28th round permutation and the 29th round permutation, we can recover a 64 bit post whitening key on an average of 17 fault samples.
出处
《计算机工程与科学》
CSCD
北大核心
2011年第10期39-44,共6页
Computer Engineering & Science
基金
国家自然科学基金资助项目(60970116
60970115
90718006)