摘要
基于环面自同构的强混沌特性,Kocarev提出了一种公钥加密方案。理论分析表明,离散环面自同构与剩余类环上Chebyshev多项式相联系。作者进而揭示出该方案并非一个新方案,而是LUC系统的一个特例。同时,实验测试表明,Kocarev提到的算法并未使该方案具有更高的效率。
Based on strong chaoticity of the torus automorphisms, a public key encryption scheme is proposed by L. Kocarev. Theoretical analysis shows that discrete torus automorphism is related to Chebyshev polynomial, and the scheme is not a novel scheme but a special case of LUC system. Meanwhile, experiment test shows that the algorism proposed by Kocarev cannot make the scheme possess higher efficiency.
出处
《计算机科学》
CSCD
北大核心
2007年第12期91-93,共3页
Computer Science
关键词
环面自同构
切比雪夫多项式
混沌
公钥加密
Torus automorphism, Chebshev polynomial, Chaos, Public key encryption