摘要
定时攻击是指攻击者试图通过分析执行加密算法所需要的时间,从而对加密系统进行的破解攻击。本文从定时攻击的概念及原理出发,继而以模幂运算作为加密算法为例,模拟了对该计算进行破解的过程,最后分析了定时攻击的优点、存在的问题以及发展趋势。
Timing attack is a form of attack where the attacker tries to break a cryptosystem by analyzing the time taken to execute cryptographic algorithms. This thesis firstly introduces the basic theory of timing attack and the discription of the related algorithms, and then taking the modular exponentiations for example, emulates the attack process, finally analysises the advantages, several problems waiting for further study and the trend of timing attack.
出处
《微计算机信息》
北大核心
2006年第08X期93-95,共3页
Control & Automation
基金
国家自然科学基金(60571037)
关键词
定时攻击
模幂运算
平方-乘法算法
timing attack,modular exponentiations, square-and-multiply algorithm