摘要
基于访问驱动攻击模型，提出一种针对椭圆曲线滑动窗口算法的踪迹驱动Cache计时攻击方法，引入了方差思想判断每次窗口滑动是否查找了预计算表，提高了攻击成功率．仿真实验结果表踞：由于滑动窗口算法引入了预计算表，易遭受Cache计时攻击．精确采集NITT-192一次加密过程中窗口105次滑动的Cache时间信息即可获取完整密钥．本文的攻击方法对其他使用预计算表的公钥密码具有借鉴意义．
This paper proposes a trace driven Cache timing attack on sliding window algorithmic based on the model of trace driven attack, and introduces the variance to judge whether window sliding has accessed pre-compute table. It enhances the success rate of attack. The experiment results demonstrate that sliding window algorithmic is susceptible to Cache timing attack because of pre-compute table. Full NIST-192 bits key can be recovered by collecting 105 times window sliding in encrypting only once. The method presented here can provide some ideas for Cache tim- ing attack on other public cryptosystems using sliding window method.
出处
《军械工程学院学报》
2012年第3期41-45,共5页
Journal of Ordnance Engineering College
基金
国家自然科学基金资助项目（60772082）
河北省自然科学基金数学研究专项资助项目（08M010）
关键词
CACHE计时攻击
踪迹驱动
椭圆曲线密码
滑动窗口算法
预计算表
Cache-Timing attack
trace driven
elliptic curve cryptosystems
sliding window algo- rithmic
pre-compute table
