A high-performance hybrid random number generator based on a nondegenerate coupled chaos and its practical implementation

Ming, Hao; Hu, Hanping; Lv, Fei; Yu, Rongjie

doi:10.1007/s11071-022-07838-0

Cited by 8 publications

(2 citation statements)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where ξ wV m is as in (154). Also recall that -in accordance with Remark 70 -the involved P aux may also depend on the sample Y n 1 ; for the special case P aux := P emp n (Y n 1 ) we obtain ξ wV m = ξ wV n,m,Y (cf.…”

Section: Naive Estimators Of Min and Argmin -Base-divergence-methods ...supporting

confidence: 53%

A Precise Bare Simulation Approach to the Minimization of Some Distances. I. Foundations

Broniatowski¹,

Stummer

2023

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

The constrained minimization (respectively maximization) of directed distances and of related generalized entropies is a fundamental task in information theory as well as in the adjacent fields of statistics, machine learning, artificial intelligence, signal processing and pattern recognition. In our previous paper "A precise bare simulation approach to the minimization of some distances. I. Foundations", we obtained such kind of constrained optima by a new dimension-free precise bare (pure) simulation method, provided basically that (i) the underlying directed distance is of f −divergence type, and that (ii) this can be connected to a light-tailed probability distribution in a certain manner. In the present paper, we extend this approach such that constrained optimization problems of a very huge amount of directed distances and generalized entropies -and beyond -can be tackled by a newly developed dimension-free extended bare simulation method, for obtaining both optima as well as optimizers. Almost no assumptions (like convexity) on the set of constraints are needed, within our discrete setup of arbitrary dimension, and our method is precise (i.e., converges in the limit). For instance, we cover constrained optimizations of arbitrary f −divergences, Bregman distances, scaled Bregman distances and weighted ℓr−distances. The potential for wide-spread applicability is indicated, too; in particular, we deliver many recent references for uses of the involved distances/divergences in various different research fields (which may also serve as an interdisciplinary interface).

show abstract

Section: Naive Estimators Of Min and Argmin -Base-divergence-methods ...supporting

confidence: 53%

A Precise Bare Simulation Approach to the Minimization of Some Distances. I. Foundations

Broniatowski¹,

Stummer

2023

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…In order to further improve the dynamics of multidimensional chaotic models, it is necessary to apply the anti-chaotic dynamics degradation method to multidimensional chaotic models. Ming et al composes the tent map with the analog anti-control into a coupled 2D delayed chaotic map [14], Huang et al composes two one-dimensional logistic chaotic maps into one two-dimensional chaotic map by interchanging the values of different dimensions, and at the same time introduces delays to increase the complexity of the system [15]. But the delayed states on which they are based are often empirical and not mathematically analyzed.…”

Section: Introductionmentioning

confidence: 99%

A two-dimensional chaotic model and its application in image encryption

Lei,

Liu

2024

Phys. Scr.

View full text Add to dashboard Cite

In this paper, we propose a rule that follows a time-varying delay construction method and construct a time-varying delay scheme based on it. This construction scheme is also combined with a polynomial to obtain a novel two-dimensional chaotic model. Both mathematical analysis and experimental results show that the model satisfies the chaos condition. Good experimental results have been achieved in complexity analysis, information entropy analysis, and Auto-correlation analysis, and have certain competitiveness. The obtained chaotic model is also applied to the image encryption algorithm. The experimental results show that the encryption algorithm has high security and can effectively resist noise attacks, shear attacks, differential attacks.

show abstract

Generation of ideal chaotic sequences by reducing the dynamical degradation of digital chaotic maps

Zhang

Liu

2023

Soft Comput

View full text Add to dashboard Cite

A high-performance hybrid random number generator based on a nondegenerate coupled chaos and its practical implementation

Cited by 8 publications

References 49 publications

A Precise Bare Simulation Approach to the Minimization of Some Distances. I. Foundations

A Precise Bare Simulation Approach to the Minimization of Some Distances. I. Foundations

A two-dimensional chaotic model and its application in image encryption

Generation of ideal chaotic sequences by reducing the dynamical degradation of digital chaotic maps

Contact Info

Product

Resources

About