VIVS准混沌算法的初值敏感性检验方法  

Initial Sensitivity Testing Method for Variable Initial Value/Variable Structure(VIVS) Quasi-Chaos Algorithm

作　　者：龙德浩[1] 陈志清[2] 

机构地区：[1]四川大学,成都610064 [2]成都大学,成都610106

出　　处：《电讯技术》2012年第1期23-26,共4页Telecommunication Engineering

摘　　要：提出了互相关绝对极大值通用编码算法的初值敏感性检验法,包括方法的定义、步骤和判决准则,给出了通用编码算法初值敏感性检验文件。变初值变结构(VIVS)准混沌算法初值敏感性检验结果表明,VIVS准混沌算法以概率0.985 5具有初值敏感性,这是经典的Gold码和m码算法都不具备的。该结论为证明VIVS准混沌算法满足Shannon完全保密性定理的充要条件和探索大容量CD-MA码族奠定了基础。The initial sensitivity testing method for cross - correlation absolute maximum value general coding algorithm is proposed, including the definition, steps and decision criterion. The initial sensitivity testing file is provided. The test result of variable initial value/variable structure（VIVS） quasichaos algorithm shows that the VIVS quasi - chaos algorithm possesses the initial value sensitivity with 0.985 5 probability which is not possessed by classical Gold code and m code algorithms. The conclusion provides foundation for proving that the VIVS quasi - chaos algorithm satisfies the necessary and sufficient condition for Shannon complete confidentiality theorem, and exploiting large capacity CDMA codes.

关 键 词：信息安全 准混沌 变初值变结构 初值敏感性 定量检验 

分 类 号：TN918[电子电信—通信与信息系统]