摘要
给出了一种改进的计时攻击方法。针对采用Montgomery模指数运算和中国剩余定理的RSA快速实现算法,通过分析在Montgomery模指数运算中额外约简发生的概率,得到RSA输入参数与运行时间之间的关系,并通过选择密文输入,计时分析按位获取RSA的秘密因子,最终破解了RSA的因子分解。
This paper presents an improved method for timing attack. It can attack the fast implementation of RSA, including Montgomery exponentiation algorithm and Chinese remainder theorem. It gets the relationship between the input parameters and execution time of RSA by analyzing the probability of extra reduction during Montgomery exponentiation operation, and gets the secret factors bit by bit by timing analyzing with the chosen input ciphertexts, and exposes the factorization of RSA.
出处
《计算机工程》
CAS
CSCD
北大核心
2007年第12期191-192,204,共3页
Computer Engineering
基金
国家自然科学基金资助项目(60571037)
军械工程学院科学研究基金资助项目(YJJXM0630)
