A randomized binary modular exponentiation based RSA algorithm against the comparative power analysis
文献类型：会议论文
| 作者 | Xucheng Yin; Keke Wu; Huiyun Li; Guoqing Xu |
| 出版日期 | 2012 |
| 会议名称 | Intelligent Control, Automatic Detection and High-End Equipment (ICADE), 2012 IEEE International Conference on |
| 会议地点 | 中国 |
| 英文摘要 | In this paper, we propose a binary modular exponentiation RSA countermeasure in order to defend against the comparative power analysis by dividing the private key e into n random parts and randomly choosing one of the parts to do one unit operation each selection till the modular exponentiation of all parts are completed. When the bit length of the private key computed actually is less than 4/3 of the original bit length of the private key, our method is more efficient and has more probability to against the exhaustive attack than the squaring-and-multiply-always right-to-left binary method which was previously considered to be the only effective binary method against the comparative power analysis. Further, the efficiency and security of our algorithm can be improved even more by adopting the parallel computing architecture. |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/3824]  |
| 专题 | 深圳先进技术研究院_集成所 |
| 作者单位 | 2012 |
| 推荐引用方式 GB/T 7714 | Xucheng Yin,Keke Wu,Huiyun Li,et al. A randomized binary modular exponentiation based RSA algorithm against the comparative power analysis[C]. 见:Intelligent Control, Automatic Detection and High-End Equipment (ICADE), 2012 IEEE International Conference on. 中国. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。