On Pseudorandom Sequences Generated by Modified Lorentz System

Author(s):  
O. A. Sivintseva ◽  
M. Yu. Zuev
2009 ◽  
Vol 29 (11) ◽  
pp. 2946-2947
Author(s):  
Jin-mei LIU ◽  
Shui-sheng QIU

2011 ◽  
Vol 33 (5) ◽  
pp. 1198-1203 ◽  
Author(s):  
Xiao-jun Chen ◽  
Zan Li ◽  
Bao-ming Bai ◽  
Wei Pan ◽  
Qing-hua Chen

2002 ◽  
Vol 135 (4) ◽  
pp. 321-326 ◽  
Author(s):  
Walter Philipp ◽  
Robert Tichy

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Shih-Yu Li ◽  
Cheng-Hsiung Yang ◽  
Li-Wei Ko ◽  
Chin-Teng Lin ◽  
Zheng-Ming Ge

We expose the chaotic attractors of time-reversed nonlinear system, further implement its behavior on electronic circuit, and apply the pragmatical asymptotically stability theory to strictly prove that the adaptive synchronization of given master and slave systems with uncertain parameters can be achieved. In this paper, the variety chaotic motions of time-reversed Lorentz system are investigated through Lyapunov exponents, phase portraits, and bifurcation diagrams. For further applying the complex signal in secure communication and file encryption, we construct the circuit to show the similar chaotic signal of time-reversed Lorentz system. In addition, pragmatical asymptotically stability theorem and an assumption of equal probability for ergodic initial conditions (Ge et al., 1999, Ge and Yu, 2000, and Matsushima, 1972) are proposed to strictly prove that adaptive control can be accomplished successfully. The current scheme of adaptive control—by traditional Lyapunov stability theorem and Barbalat lemma, which are used to prove the error vector—approaches zero, as time approaches infinity. However, the core question—why the estimated or given parameters also approach to the uncertain parameters—remains without answer. By the new stability theory, those estimated parameters can be proved approaching the uncertain values strictly, and the simulation results are shown in this paper.


2021 ◽  
Vol 58 (3) ◽  
pp. 319-334
Author(s):  
Huaning Liu ◽  
Yinyin Yang

In cryptography one needs pseudorandom sequences whose short subsequences are also pseudorandom. To handle this problem, Dartyge, Gyarmati and Sárközy introduced weighted measures of pseudorandomness of binary sequences. In this paper we continue the research in this direction. We introduce weighted pseudorandom measure for multidimensional binary lattices and estimate weighted pseudorandom measure for truly random binary lattices. We also give lower bounds for weighted measures of even order and present an example by using the quadratic character of finite fields.


Sign in / Sign up

Export Citation Format

Share Document