Improvement of a Universal Algorithm for Uniformization of Chaotic Pseudo-Random Sequences
LI Pei-yue1, SHI Jun-xia2, GUO Jia-liang1, CHEN Xue1, YANG Huai-jiang1
1. State Key Laboratory of Applied Optics, Changchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun, Jilin 130033, China;
2. Changchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun, Jilin 130033, China
In order to analyze the security and universality of the arithmetic proposed by Sheng et al,the concept of information loss in single iteration and average speed of information loss in dynamic system is proposed based on information theory.It is shown that the information loss of the 2nd bit-operation transformation is 12 bits,and which of the standard 2nd bit-operation transformation is related to the exponent e.It is possible that the information loss of the 2nd bit-operation transformation is so small.Not all of the float number in[-1,1]can be traversed by the standard 2nd bit-operation transformation just because the 1023-e is used as the shift number.The concept of transient data and 1st transient transformation is proposed further,and the arithmetic proposed in literature[14]is improved as well.The output sequence of random digital chaotic system can be transformed as float number in[0,1]by the improved arithmetic.The information loss of this transformation is L-1 bits,which is approached to the maximum speed of information loss Imax=L under the computing precision L.The transformed sequence is uniform distributed which can be proved by χ-verification.
李佩玥, 石俊霞, 郭嘉亮, 陈雪, 杨怀江. 一种混沌伪随机序列均匀化普适算法的改进[J]. 电子学报, 2015, 43(4): 753-759.
LI Pei-yue, SHI Jun-xia, GUO Jia-liang, CHEN Xue, YANG Huai-jiang. Improvement of a Universal Algorithm for Uniformization of Chaotic Pseudo-Random Sequences. Chinese Journal of Electronics, 2015, 43(4): 753-759.
[1] Gottlieb Pirsic,Arne Winterhof.On the structure of digital explicit nonlinear and inversive pseudorandom number generators[J].Journal of Complexity,2010,26(1):43-50.
[2] A Peinado,A Fuster-Sabater.Generation of pseudorandom binary sequences by means of linear feedback shift registers(LFSRS) with dynamic feedback[J].Mathematical and Computer Modelling,2013,57(11-12):2596-2604.
[3] Kit-Ho Mak.More constructions of pseudorandom sequences of k symbols[J].Finite Fields and Their Applications,2014,25(1):222-233.
[4] A Kanso,N Smaoui.Logistic chaotic maps for binary numbers generations[J].Chaos,Solitons and Fractals,2009,40(5):2557-2568.
[5] Hanping Hu,LingFeng Liu,NaiDa Ding.Pseudorandom sequence generator based on the Chen chaotic system[J].Computer Physics Communications,2013,184(3):765-768.
[6] L Palacios-Luengas,G Delgado-Gutierrez,M Cruz-Irisson,J L Del-Rio-Correa,RVazquez-Medina.Digital noise produced by a non discretized tent chaotic map[J].Microelectronic Engineering,2013,112(1):264-268.
[7] Ping Li,Zhong Li,Wolfgang A Halang,Guanrong Chen.A multiple pseudorandom-bit generator based on a spatiotemporal chaotic map[J].Physics Letters A,2006,349(6):467-473.
[8] Liu Nian-sheng.Pesudo-randomness and complexity of binary sequences generated by the chaotic system[J].Communications in Nonlinear Science and Numerical Simulation,2011,16(2):761-768.
[9] M Francois,T Grosges,D Barchiesi,R Erra.Pseudo-random number generator based onmixing of three chaotic maps[J].Communications in Nonlinear Science and Numerical Simulation,2014,19(4):887-895.
[10] 孙克辉,贺少波,何毅,尹林子.混沌伪随机序列的谱熵复杂性分析[J].物理学报,2013,62(1):010501-1-010501-8. Kehui Sun,Shaobo He,Yi He,Linzi Yin.Complexity analysis of chaotic pseudo-random sequences based on spectral entropy algorithm[J].Acta Physica Sinica,2013,62(1):010501-1-010501-8.(in Chinese)
[11] Xiaoni Du,Andrew Klapper,Zhixiong Chen.Linear complexity of pseudorandom sequence generated by Fermat quotients and their generalizations[J].Information Processing Letters,2012,112(6):233-237.
[12] Fatih Ozkaynak,Sirma Yavuz.Security problems for a pseudorandom sequence generator based on the Chen chaotic system[J].Computer Physics Communications,2013,184(9):2178-2181.
[13] K J Persohn,R J Povinelli.Analyzing logistic map pseudorandom number generators for periodicity induced by finite precision floating-point representation[J].Chaos,Solitons and Fractals,2012,45(3):238-245.
[14] 盛利元,肖燕予,等.将混沌序列变换成均匀伪随机序列的普适算法[J].物理学报,2008,5(7):4007-4013. Sheng Liyuan,Xiao Yanyu,et al.A universal algorithm for transforming chaoticsequences into uniform pseudo-random sequences[J].Acta Physica Sinica,2008,5(7):4007-4013.(in Chinese)
[15] 张占锋,盛利元,刘长水.混沌伪随机序列均匀化普适算法的FPGA实现[J].计算机测量与控制,2009,17(12):2525-2554. Zhang Zhanfeng,Sheng Liyun,liu Changshui.FPGA implementation of a universal algorithm for uniformization of chaotic pseudo-random sequences[J].Computer Measurement & Control,2009,17(12):2525-2554.(in Chinese)
2015, Vol. 43 
