arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0811.1823nlin.CD
收藏

有限精度下鲁棒混沌映射切换增加平均周期律

Increasing Average Period Lengths by Switching of Robust Chaos Maps in Finite Precision

Nithin Nagaraj, Mahesh C. Shastry, Prabhakar G. Vaidya

摘要:

Grebogi,Ott和Yorke(Phys.Rev.A38(7),1988)研究了有限精度对混沌映射平均周期长度的影响。他们表明,动力系统的周期轨道的平均长度($T$)是计算机精度($ε$)和混沌吸引子($T \sim ε^{-d/2}$)的关联维数($d$)的函数。在这项工作中,我们关注的是增加的平均周期长度,这是可取的混沌密码学的应用。我们的实验表明,随机和混沌切换的确定性混沌动力系统产生更高的平均周期轨道长度相比,简单的顺序切换或没有切换。为了说明开关的应用,首先介绍了一种新的广义的Logistic映射,表现出鲁棒混沌(缺乏吸引周期轨道)。然后,我们提出了一个伪随机数发生器的基础上的鲁棒混沌映射,成功地通过严格的统计测试的随机性之间的混沌切换。

英文摘要:

Grebogi, Ott and Yorke (Phys. Rev. A 38(7), 1988) have investigated the effect of finite precision on average period length of chaotic maps. They showed that the average length of periodic orbits ($T$) of a dynamical system scales as a function of computer precision ($ε$) and the correlation dimension ($d$) of the chaotic attractor: $T \sim ε^{-d/2}$. In this work, we are concerned with increasing the average period length which is desirable for chaotic cryptography applications. Our experiments reveal that random and chaotic switching of deterministic chaotic dynamical systems yield higher average length of periodic orbits as compared to simple sequential switching or absence of switching. To illustrate the application of switching, a novel generalization of the Logistic map that exhibits Robust Chaos (absence of attracting periodic orbits) is first introduced. We then propose a pseudo-random number generator based on chaotic switching between Robust Chaos maps which is found to successfully pass stringent statistical tests of randomness.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑