Periodicity Analysis of the Logistic Map over Ring ℤ_3^n

by   Xiaoxiong Lu, et al.

Periodicity analysis of sequences generated by a deterministic system is a long-standing challenge in both theoretical research and engineering applications. To overcome the inevitable degradation of the Logistic map on a finite-precision circuit, its numerical domain is commonly converted from a real number field to a ring or a finite field. This paper studies the period of sequences generated by iterating the Logistic map over ring ℤ_3^n from the perspective of its associate functional network, where every number in the ring is considered as a node, and the existing mapping relation between any two nodes is regarded as a directed edge. The complete explicit form of the period of the sequences starting from any initial value is given theoretically and verified experimentally. Moreover, conditions on the control parameter and initial value are derived, ensuring the corresponding sequences to achieve the maximum period over the ring. The results can be used as ground truth for dynamical analysis and cryptographical applications of the Logistic map over various domains.


Ergodic dynamical systems over the Cartesian power of the ring of p-adic integers

For any 1-lipschitz ergodic map F: ℤ^k_p↦ℤ^k_p, k>1∈ℕ, there are 1-lipsc...

Formalizing the Ring of Adèles of a Global Field

The ring of adèles of a global field and its group of units, the group o...

Algebraic independence of sequences generated by (cyclotomic) harmonic sums

An expression in terms of (cyclotomic) harmonic sums can be simplified b...

Second-Order Agents on Ring Digraphs

The paper addresses the problem of consensus seeking among second-order ...

Zooming into chaos for a fast, light and reliable cryptosystem

In previous work, the k-logistic map [Machicao and Bruno, Chaos, vol. 27...

Please sign up or login with your details

Forgot password? Click here to reset