首页期刊简介编委会征稿启事出版道德声明审稿流程读者订阅论文查重联系我们English
引用本文
  • 龙德浩,陈志清.VIVS准混沌算法的初值敏感性检验方法[J].电讯技术,2012,52(1): - .    [点击复制]
  • LONG De-hao,CHEN Zhi-qing.Initial sensitivity testing method for variable initial value/variable structure(VIVS) quasi-chaos algorithm[J].,2012,52(1): - .   [点击复制]
【打印本页】 【下载PDF全文】 查看/发表评论下载PDF阅读器关闭

←前一篇|后一篇→

过刊浏览    高级检索

本文已被:浏览 1946次   下载 150 本文二维码信息
码上扫一扫!
VIVS准混沌算法的初值敏感性检验方法
龙德浩,陈志清
0
(四川大学,成都 610064;成都大学,成都 610106)
摘要:
提出了互相关绝对极大值通用编码算法的初值敏感性检验法,包括方法的定义、步骤和判决 准则,给出了通用编码算法初值敏感性检验文件。变初值变结构(VIVS)准混沌算法初值敏 感性检验结果表明,VIVS准混沌算法以概率0.985 5具有初值敏感性,这是经典的Gold 码和m码算法都不具备的。该结论为证明VIVS准混沌算法满足Shannon完全保密性定理的充要 条件和探索大容量CDMA码族奠定了基础。
关键词:  信息安全  准混沌  变初值变结构  初值敏感性  定量检验
DOI:
基金项目:
Initial sensitivity testing method for variable initial value/variable structure(VIVS) quasi-chaos algorithm
LONG De-hao,CHEN Zhi-qing
()
Abstract:
The initial sensitivity testing method for cross-correlation absolute maximum va lue general coding algorithm is proposed, including the definition, steps and de c ision criterion.The initial sensitivity testing file is provided. The test resul t of variable initial value/variable structure(VIVS) quasi-chaos algorithm shows that the VIVS quasi-chaos algorithm possesses the initial value sensitivity wit h 0.985 5 probability which is not possessed by classical Gold code and m code algorithms.The conclusi on provides foundation for proving that the VIVS quasi-chaos algorithm satisfies the necessary and sufficient condition for Shannon complete confidentiality the orem,and exploiting large capacity CDMA codes.
Key words:  information security  quasi-chaos  VIVS  initial value s ensitivity  quantitative testing
安全联盟站长平台