Analysis of Some Recently Proposed Chaos-based Public Key Encryption Algorithms

摘要：

we analyze the three recent public key encryption algorithms based on chaos. The analysis shows that one of these algorithms is unsafe in protocol. Another is actually reformulation of the standard RSA algorithm, but its encryption and decryption rates and capacity of memory are not comparable to those of RSA algorithm. The third one is vulnerable to exhaustive or digital analytic attacks.

作者: Geng Zhao Jianxin Wang Fangfang Lu

作者单位: Department of Computer Science and Technology, Beijing Electrical Science and Technology Institute B School of Information Beijing Forestry University Beijing, China Department of Electrical Engineering City University Hong Kong, China

会议类型: 国际会议

会议名称: 2006 International Conference on Communications,Circuits and Systems(第四届国际通信、电路与系统学术会议)

会议地点: 广西桂林

会议语种:英文

页码: 1573-1576

在线出版日期: 2006-06-25（万方平台首次上网日期，不代表论文的发表时间）