Next Article in Journal
GDCP-YOLO: Enhancing Steel Surface Defect Detection Using Lightweight Machine Learning Approach
Previous Article in Journal
Hybrid Approach to Improve Recommendation of Cloud Services for Personalized QoS Requirements
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Deterministic Chaos-Model-Based Gaussian Noise Generator

1
Department of Radioengineering and Information Security, Yuriy Fedkovych Chernivtsi National University, 58002 Chernivtsi, Ukraine
2
Institute of Telecommunications, Riga Technical University, 1048 Riga, Latvia
3
Department of Electronics and Telecommunications, Politecnico di Torino, 10129 Torino, Italy
*
Author to whom correspondence should be addressed.
Electronics 2024, 13(7), 1387; https://doi.org/10.3390/electronics13071387
Submission received: 3 March 2024 / Revised: 31 March 2024 / Accepted: 1 April 2024 / Published: 6 April 2024
(This article belongs to the Special Issue Nonlinear Circuits and Systems: Latest Advances and Prospects)

Abstract

:
The abilities of quantitative description of noise are restricted due to its origin, and only statistical and spectral analysis methods can be applied, while an exact time evolution cannot be defined or predicted. This emphasizes the challenges faced in many applications, including communication systems, where noise can play, on the one hand, a vital role in impacting the signal-to-noise ratio, but possesses, on the other hand, unique properties such as an infinite entropy (infinite information capacity), an exponentially decaying correlation function, and so on. Despite the deterministic nature of chaotic systems, the predictability of chaotic signals is limited for a short time window, putting them close to random noise. In this article, we propose and experimentally verify an approach to achieve Gaussian-distributed chaotic signals by processing the outputs of chaotic systems. The mathematical criterion on which the main idea of this study is based on is the central limit theorem, which states that the sum of a large number of independent random variables with similar variances approaches a Gaussian distribution. This study involves more than 40 mostly three-dimensional continuous-time chaotic systems (Chua’s, Lorenz’s, Sprott’s, memristor-based, etc.), whose output signals are analyzed according to criteria that encompass the probability density functions of the chaotic signal itself, its envelope, and its phase and statistical and entropy-based metrics such as skewness, kurtosis, and entropy power. We found that two chaotic signals of Chua’s and Lorenz’s systems exhibited superior performance across the chosen metrics. Furthermore, our focus extended to determining the minimum number of independent chaotic signals necessary to yield a Gaussian-distributed combined signal. Thus, a statistical-characteristic-based algorithm, which includes a series of tests, was developed for a Gaussian-like signal assessment. Following the algorithm, the analytic and experimental results indicate that the sum of at least three non-Gaussian chaotic signals closely approximates a Gaussian distribution. This allows for the generation of reproducible Gaussian-distributed deterministic chaos by modeling simple chaotic systems.

1. Introduction

Chaos theory has radically revolutionized our understanding of the potential for complex, unpredictable behavior within seemingly simple deterministic systems. This phenomenon, known as chaos, arises in nonlinear systems and is characterized by extreme sensitivity to initial conditions, often leading to the iconic “butterfly effect”. Chaotic dynamics are remarkably pervasive, manifesting in diverse domains such as social, biological, and technical systems [1,2,3,4,5,6].
Security threads and challenges prompt scientists to research how chaotic signals are suitable to resolve these issues. Numerous applications have been proposed, including secure and covert communication, pseudo-random number generators (PRNGs) and cryptography [7,8,9,10,11,12,13,14]. Despite the diverse applications and varying advantages and drawbacks in each of these scopes, chaotic systems are used as sources of entropy, a fundamental property crucial for security applications.
Chaos generators, present in both hardware and software implementation, produce time series that either mask information-bearing signals or undergo postprocessing for various cryptographic purposes. Chaotic trajectories form strange attractors in phase space, which, in contradiction to the limit cycle that represents regular behavior, have fractional or fractal dimensions [1]. There are several variants of fractal dimensions, generally measuring the average closeness, density, and distribution of points on chaotic attractors in phase space. Chaos sources are categorized into two groups, including continuous time and discrete map systems. Due to differences in attractor properties, the trajectories of a chaotic system exhibit different statistics reflected in their probability density functions (PDFs). Chaos applications necessitate a high-quality entropy source, emphasizing the necessity to maximize the entropy of chaotic signals. Statistical analyses have been proposed by Yong Wang et al. to increase the quality of chaos for the same purpose as in this paper [15]. Concerning PDFs, the most important are a number with a uniform PDF and Gaussian-distributed signals with a bell-shaped PDF. The first requirement is common in cryptography; the second is useful in communication. Both of them maximize the uncertainty of range-limited and variance-limited signals, respectively [16].
A two-dimensional discrete-time white Gaussian noise generator was proposed in [17]. To obtain an independent time series with a Gaussian probability density function, a special transformation was used on the tent map. A similar approach to the same tent map demonstrated the efficiency of the transformation method [18].
A Gaussian distribution is not the sole target widely sought in signal processing. Contributions in this direction also focus on achieving a uniform probability density. In [19], it is proven that the folding sums of chaotic trajectories, bounded within a given interval by modulus operation, tend to approach uniformity. It is worth noting that certain discrete chaotic systems yield series with a uniform probability density function without requirement of additional transformations [20,21,22,23,24,25].
Significant achievements have been attained in the realm of optical chaos generators [26,27,28,29,30,31]. Wideband optical chaos exhibits a heightened propensity for Gaussian-distributed probability density functions. This characteristic has prompted suggestions for harnessing optical chaos generators as high-quality, ultra-fast entropy sources [28,29]. A recently reported experimental technique focuses on generating a Gaussian-invariant distribution [32]. Such sources hold potential for diverse applications spanning communication [33,34], random number generation [26,27], and cryptography [30,35].
Covert communication, originally designed to conceal and render the transmission undetectable, is now being harnessed for commercial and private applications to provide physical-level protection. In contrast to conventional communication, where Gaussian white noise diminishes the signal-to-noise ratio, covert communication employs it as a countermeasure against eavesdroppers. Thermal noise is utilized to randomize the transmitted signal in a Gaussian-distributed spread spectrum [36]. Additionally, extending this concept, the utilization of artificially generated Gaussian-distributed noise has been proposed across diverse scenarios [37,38,39,40]. Despite the fact that hundreds of chaotic systems have been designed and studied, few of them can produce Gaussian-distributed signals. Therefore, finding an approach for obtaining the most complex chaotic signal based on simple and well-studied nonlinear systems is important. In this paper, we propose a method to obtain Gaussian-distributed signals. To achieve this, we study the statistical properties of some chaotic signals to find out how much of them are necessary to form a Gaussian-distributed waveform with the following experimental investigation and achievement verification that allow for an implementation of “deterministic noise” generators. With this aim, we have suggested an algorithm that combines the most valued statistical characteristics for the considered signal assessment.
The manuscript is organized as follows. In Section 2, we describe the quality metrics used to evaluate and compare chaotic signals. The properties of time series produced by mathematic models of Chua’s circuit and the Lorenz system are studied in Section 3. Experimental verification of the results is provided in Section 4. The discussion and conclusion are presented in Section 5. Appendix A presents the results of computing the statistical properties of more than 40 continuous-time chaotic systems found in the literature.

2. Materials and Methods

2.1. Central Limit Theorem

The central limit theorem (CLT) relates to probability theory and explains why Gaussian noise is widespread in nature. For identically distributed independent samples, the standardized sample mean tends towards the standard normal distribution even if the original variables themselves are not normally distributed. There are several variants of the CLT. In its common Lindeberg–Lévy form, the CLT is as follows [41,42]:
Theorem 1.
Suppose { X 1 , , X n } is a sequence of independent and identically distributed random variables with expectation E [ X i ] = μ and variance Var [ X i ] = σ 2 < . Then, as n approaches infinity, the random variables n ( 1 n i = 1 n X i μ ) converge in distribution to a normal N ( 0 , σ 2 ) .
The CLT shows a way to obtain a variable with a Gaussian-like distribution from several others by summation. The key condition for particular components is their limited variance, which chaotic signals satisfy due to the existence of their attractors in bounded phase space. The question is to find how many independent chaotic signals are necessary and which criteria the resulting signal should meet to be considered Gaussian-like. Therefore, the following consideration of the basic distributions will present the possibility to develop an algorithm for testing chaotic signals.

2.2. Basic Distributions

As a reference signal, we chose white Gaussian noise whose statistical properties can be described by three basic distributions which are the PDF of the shape, the envelope and the phase of the signal.
The term “Gaussian noise” or “Gaussian signal” refers to a normal or bell-shaped probability density function of a signal. Such signals can be either random noise or information-bearing. A Gaussian variable has the following PDF
p ( x ) = 1 2 π σ e ( x μ ) 2 2 σ 2 ,
where σ —standard deviation; μ —mathematical expectation or mean.
The envelope of white noise has a Rayleigh distribution
p ( x , σ ) = x σ 2 e x 2 2 σ 2 ,
where σ —standard deviation of the Gaussian distribution (1).
A uniform distribution describes the phase of a signal
p ( ϕ ) = 1 2 π ,
where 0 ϕ 2 π .

2.3. Measures of Similarity of Probability Density Functions

To evaluate the similarity of any signal to WGN, normality tests that include computing of skewness and excess kurtosis are conventionally utilized [43].
Skewness is a measure of the asymmetry of a PDF around its mean and is defined as the normalized third central moment of a signal
μ ˜ 3 = E x μ σ 3 ,
where E —expectation operator.
Excess kurtosis is the metric of the height and sharpness of a PDF relative to that of a standard bell curve
μ ˜ 4 = E x μ σ 4 3 .
For WGN, both the skewness and excess kurtosis are equal to zero.
It is worth noting that if a signal exhibits a symmetric distribution with zero excess kurtosis, it by no means guarantees that its probability density function is normal. There are non-Gaussian distributions with μ ˜ 3 = 0 and μ ˜ 4 = 0 [44,45]. Therefore, at least a graphical analysis is necessary to confidently assert the normality of the distribution, or confirmation should be achieved through more sophisticated tests.
The envelope and phase of a signal can be found by using the Hilbert transform [46]. For a given function x ( t ) , the Hilbert transform is given as
x ^ ( t ) = H x ( t ) = 1 π x ( t ) t τ d τ .
Then, the envelope and phase of x ( t ) are
a ( t ) = x 2 ( t ) + x ^ 2 ( t ) ,
ϕ ( t ) = arctan x ^ ( t ) x ( t ) .
If x ( t ) is WGN, the envelope a ( t ) has a Rayleigh PDF (2), and the phase ϕ ( t ) has a uniform PDF (3).
The informational properties of signals can be assessed by their differential entropy. For a variable x with a probability density function p ( x ) , the differential entropy is given by
h = p ( x ) log p ( x ) d x .
The Gaussian distribution (1) attains the maximum differential entropy, which, for μ = 0 and variance σ 2 , is equal to
h g = 1 2 ln 2 π e σ 2 .
For any other signal with the same variance σ 2 , the differential entropy h ( x ) does not exceed the value given in (10), i.e., h ( x ) h g ( x ) .
Entropy power, a concept pioneered by Shannon [47], allows us to compare the probability density functions of a signal and Gaussian noise:
k 1 = e 2 h 2 π e , 0 k 1 1 ,
where h—entropy of signal.
The entropy power of a distribution coincides with the variance of a Gaussian distribution possessing an identical entropy.
To compare two arbitrary PDFs, we used the entropy power ratio, mathematically defined as follows for distributions p 1 ( x ) and p 2 ( x ) bearing entropies h 1 and h 2 , respectively:
k 1 ( h 2 ) k 1 ( h 1 ) = e 2 Δ h ,
where Δ h = h 1 h 2 —the difference between differential entropies of two distributions.
To restrict the value of ratio (12) into interval 0 k 1 1 , the following expression can be applied:
k = e 2 | Δ h | .
The entropy power (13) increases when the difference between entropies of distributions becomes smaller.
To evaluate the similarity of probability density functions with an amplitude and a phase with the reference distributions, we utilize the entropy power relative to these baseline distributions. Thus, the entropy power of the envelope of the signal is determined as:
k 2 = e 2 | h e h R | ,
where h e —entropy of the envelope of signal; h R = 1 + ln σ 2 + γ 2 —entropy of a Rayleigh PDF (2) [44]; and γ 0.577 —Euler–Mascheroni constant.
The entropy power for evaluating the similarity of the phase distribution of the signal and a uniform one would be determined as:
k 3 = e 2 | h p h h u | ,
where h p h —entropy of the phase of the signal; h u = ln 2 π —entropy of a uniform PDF (3) [44].
Furthermore, the cross-entropy and Kullback–Leibler divergence can serve as additional metrics within the considered algorithm [48]. While not explicitly highlighted in the text, their analysis has been performed preliminarily, revealing clear results that they do not hold a decisive role in characteristic assessments for this type of study.

3. Properties of Sums of Chaotic Signals

The approach for generating a Gaussian-distributed chaotic signal is schematically illustrated in Figure 1. Selected chaotic outputs undergo normalization, followed by summation, to achieve a transformation from their original probability density function to a Gaussian PDF. The normalization step may be omitted depending on the properties of the original chaotic signals and the desired variance of the resulting sum.
There are lots of different nonlinear systems exhibiting chaotic behavior. We investigated more than 40 mostly three-dimensional chaotic systems through computing the PDFs, skewness, excess kurtosis, and entropy power of their output signals. Before estimation of the characteristic mentioned in the algorithm, each chaotic signal was centered around its zero mean and normalized to have unit variance. The results show that the majority of the studied chaotic systems exhibit characteristics that are far from being considered Gaussian-like signals.
The obtained results for a variety of chaotic systems appear in Appendix A, and a detailed description of the algorithm is analytically and experimentally demonstrated below with examples from two widely used and extensively studied systems: Chua and Lorenz. They were specifically chosen since their signals, among all examined, possess the most favorable parameters to serve as a platform for generating deterministic chaotic Gaussian signals.

3.1. Chua’s Circuit

Chua’s circuit is one of the most well-known systems that generate deterministic chaos and can be easily implemented as an electrical circuit [49]. Moreover, various types of nonlinearities can be utilized in this circuit [50,51].
The mathematical model of Chua’s circuit in dimensionless form is a three-differential equation system
x ˙ = α ( y x f ( x ) ) y ˙ = x y + z z ˙ = β y
where x, y, z—output variables; α , β —parameters of the model; and f ( x ) = m 2 x + 0.5 ( ( m 0 m 1 ) ( | x + a 1 | | x a 1 | ) + ( m 1 m 2 ) ( | x + a 2 | | x a 2 | ) ) —nonlinear function, where a 1 = 1 , a 2 = 6.88 , m 0 = 1.238 , m 1 = 0.6665 , m 2 = 500 . The connection between the circuit’s and the model’s parameters can be found in [49,52].
A key requirement to obtain independent chaotic systems is the absence of any connection between them. In analytical analysis, the independence of chaotic systems is achieved through different initial conditions of the systems; in experiments, it occurs due to the difference between the system parameters and the initial conditions, which appears naturally.
We studied Chua’s circuit with a piecewise linear characteristic in the nonlinear part, which provides various dynamical modes, including a single- or double-scroll chaotic attractor. As shown in Figure 2, the circuit consists of inductance, two capacitors, and nonlinearity and is implemented on two operational amplifiers [52].
When α = 10 and β = 14.6 , the circuit operates in double-scroll mode and all the outputs possess a symmetric PDF with skewness close to zero. The y output produces a low excess kurtosis μ ˜ 4 = 0.1421 , which also has the highest entropy power of k 1 = 0.9039 , k 2 = 0.9756 , and k 3 = 0.998 . Nevertheless, there are distinct visual differences between the PDFs of chaotic and basic distributions, which can be seen in Figure 3a,e,i and numerically from Table A1.
The central limit theorem states that the summation of two or more chaotic signals yields a PDF of the sum that exhibits a greater resemblance to a Gaussian PDF compared to that of a single signal. The evolution of the PDFs when the number n of independent chaotic signals increases is shown in Figure 3. To minimize the number of chaotic signal in the total signal, it is efficient to use the variable y. When only three independent outputs of y are added, the PDF of the sum, along with its envelope and phase, closely resembles the basic PDFs, i.e., normal, Rayleigh, and uniform PDFs. The entropy powers of the sum k 1 , k 2 , k 3 exceed 0.99 .
The quality metrics of the sum of signals are contingent upon the number of signals incorporated, as illustrated in Figure 4. The excess kurtosis decreases to zero, and all entropy powers converge to 1 with an increasing value of n. This suggests that achieving chaos resembling Gaussian noise necessitates the addition of a minimum of three original chaotic signals from Chua’s circuit.
A change in circuit parameters with preservation of the chaotic double-scroll mode causes significant changes in the quality metrics, particularly the excess kurtosis and entropy power. For example, when α = 9.273 and β = 16.8 , Chua’s circuit has the following metrics, which are quite different from ones mentioned above: E = 0.9334 , k 1 = 0.8739 , k 2 = 0.5006 and k 3 = 0.999 . This result suggests that the PDFs of signals are sensitive to the parameters of the chaotic system.

3.2. Lorenz System

While the previously considered Chua’s circuit is one of the simplest both as an analytical model and an experimental implementation, the Lorenz system is a well-known and extensively investigated source of deterministic chaos. The system was originally developed to model atmospheric convection in meteorology and allows for the description of different atmospheric phenomena [53]. The Lorenz system is usually applicable in its mathematical representation (a system of three differential equations with nonlinearity (17)) and has found widespread use in diverse fields such as physics, engineering, biology, economics, and even art. However, its hardware implementation is inherently more complex than Chua’s circuit due to the involvement of analog multipliers (Figure 5) [54].
x ˙ = σ ( y x ) y ˙ = ( r z ) x y z ˙ = x y b z
where x, y, z—system variables; σ = 10 , r = 28 , and b = 8 3 —parameters.
We simulated system (17) with two different values of the parameter r, r = 28 and r = 60 , keeping other parameters constant. The statistic parameters of the Lorenz system are shown in Table A2. Two of the three outputs in the Lorenz system, namely x and y, exhibit symmetric PDFs. Similarly to Chua’s circuit, the results indicate a significant impact of the model parameters on the appearance and characteristics of the PDFs of the output signals. For the investigated parameter values, the signal most resembling Gaussian noise is y, with σ = 10 , r = 28 , and b = 8 3 , featuring coefficients μ ˜ 4 = 0.1573 , k 1 = 0.9013 , k 2 = 0.9368 , and k 3 = 0.8877 .
The original histograms of normalized output signals from the Lorenz system are shown in Figure 6. Despite the asymmetry in the output signal z, combining all three outputs can yield a normal PDF when summing only three–four signals. The relationship between the excess kurtosis coefficient and entropy powers for different values of n is presented in Figure 7 and confirms this conclusion.
The entropy power values ( k 1 , k 2 , k 3 ) for the sum of three and four y variables exceed 0.98 and 0.99, respectively. Furthermore, a comparison of the PDFs in Figure when n = 4 suggests there are no significant discrepancies between the PDFs of the sum and the basic PDFs.
Analyses of Chua’s circuit and the Lorenz system reveal that the summation of chaotic non-Gaussian signals proves to be an effective method for obtaining deterministic chaotic Gaussian signals.

4. Experimental Verification

4.1. Experiment with Chua’s Circuit

The following results were obtained for the Chua circuit with a piecewise linear–nonlinear element implemented using TL082CP operational amplifiers, as depicted in Figure 2. Four circuits were assembled with slightly different parameters. The parameter difference was determined by the used components’ features—for the used capacitors, C 1 = 100 µF and C 2 = 10 µF; for the inductor, L = 18 mH; and they both have a tolerance of ± 5 % . The parameters of the nonlinear element were as R 2 , R 3 = 220 Ohm, R 4 = 2.2 kOhm, R 5 , R 6 = 22 kOhm, and R 7 = 3.3 kOhm.
Additionally, a potentiometer was utilized to provide a resistance R 1 = 1580 Ohm, the value of which could be adjusted in increments of ± 100 Ohm to change the chaotic circuit behavior. The voltages across the capacitors C 2 , corresponding to the variable y in the model of the circuit, were recorded and processed for further analysis. A set of signal records (50 samples of voltages across the capacitors C 2 ) was obtained, where each record contained 2 × 10 6 sweep points.
The experimental results confirmed the theoretical assumptions and analytical outcomes. As depicted in Figure 8, increasing the number of chaotic systems rapidly drives the distribution of their summed signals towards a normal distribution. This observation extends to the envelope and phase of the signal, where Rayleigh and uniform distributions were observed, respectively.

4.2. Experiment with a Lorenz System

An experimental investigation was performed using a simplified electronic realization of a Lorenz oscillator, constructed in accordance with the specifications outlined in [54,55] and the circuit in Figure 5. We used an AD633 analog multiplier and a TL084CN operational amplifier. The other circuit elements were as follows: R 1 , R 2 = 100 kOhm, R 3 , R 6 = 10 kOhm, and R 7 = 1 MOhm, with a tolerance of 5%, and R 4 = 370 Ohm, with a tolerance of 0.5%. The variable resistor R 5 allows for tuning of the parameter r and was set at R 5 = 35.72 kOhm.
Four circuits were assembled on a breadboard, and the appropriate oscillograms were recorded. Subsequently, they were subjected to the suggested set of tests. The probability density functions of the normalized output x from the electronic circuit of the Lorenz system are illustrated in Figure 9. A comparison between Figure 9 and Figure 6 reveals a good agreement between the analytic and experimental results.

5. Discussion and Conclusions

The results underscore a promising approach for generating deterministic Gaussian-like signals using an optimal number of chaotic systems. The PDFs of the original chaotic signals exhibit essential deviations from a normal distribution, indicating their inherently lower information capacity compared to fully random Gaussian noise. This observation prompts the need to establish criteria for selecting chaotic systems to achieve Gaussian signal formation through the summation of chaotic signals. This requires an optimization process to minimize the number of independent simple chaotic signals. The performed analysis demonstrates that adherence to the following guidelines significantly enhances the likelihood of a successful chaotic system and signal selection:
i.
Prioritize signals possessing symmetric probability density functions.
ii.
Minimize the excess kurtosis of the selected signals, ideally aiming for μ ˜ 4 < 1 .
iii.
Ensure that all three entropy powers ( k 1 , k 2 , k 3 ) of the original chaotic signal surpass a value of 0.85 .
While strict adherence to these guidelines does not ensure Gaussian signal achievement, it substantially increases the probability of generating a Gaussian chaotic signal with the desired entropy coefficients k 1 , k 2 , k 3 > 0.95 . Although, theoretically, there are no limitations to the number of chaotic signals that can be summed to achieve a Gaussian distribution, practical implementation has restrictions due to the lack and value of resources and the size limitation of devices. The lowest limit is defined by using the algorithm considered in this paper to merely sum three or four independent chaotic signals.
It is crucial to underscore that chaotic signals are generated by deterministic systems, rendering their summation equally deterministic. This underscores the capability of simple summation to yield intricate, noise-mimicking chaotic signals that retain their deterministic nature. The most innovative aspect of this method is the possibility of attributing the output voltage and the current of random chaotic circuits of a well-known signal as Gaussian noise, the properties of which are well known and exploitable in many applications. The possibility of obtaining a Gaussian-like signal description presents the opportunity to design and model chaotic circuits’ output voltages, preserving all the general properties of the Gaussian distribution. Moreover, since many chaotic circuits do not have output signals linked to Gaussian noise, this method allows for widening the field of investigation, even to those circuits that apparently do not have these properties. It is also considerable that more than 40 chaotic systems have been evaluated, leading to the confirmation of this theory and confirming the validity of this method.
The output signals obtained via this process hold considerable value across a variety of applications, including generating deterministic Gaussian noise, electronic warfare systems, coherent and/or covert communication systems, radars, statistical modeling, machine learning, cryptography, and more.
The possibility of obtaining a pseudo-random number generator through the simple sum of chaotic signals predisposes this method to a wide range of applications, bypassing any possible complications of chaotic signal processing. All the possible applications mentioned can support both hardware and software implementation of chaotic circuits, with the addition in this case of greater properties and guidelines that can be exploited during the implementation guaranteed by the traceability to Gaussian noise. Since the main aim is to present more known laws of circuits that in certain conditions are dominated by chaos, other aspects and elaborations of the output signals of the proposed chaotic circuits are also being investigated, which could lead back to the properties of pseudo-Gaussian noise. Future investigations will aim at trying to reconstruct more well-known properties of apparently chaotic signals, trying to make it easier to implement the chosen application.
The results of the study can find applications in the enhancement of security in communication systems. These include:
i.
Covert communication—there are approaches based on thermal noise or AI noise; therefore, our recommendation is to use artificial Gaussian-distributed chaotic signals for hidden communication;
ii.
Radio countermeasure purposes—the deterministic nature of chaotic systems can be used to reproduce and compensate for the influence of chaos in “friendly devices” and remains incomprehensible for “enemies”. This means that the same signal can be at least neutral for one device and harmful to others;
iii.
PRNG for cryptography purposes—a huge number of scientific studies are concerned with this question. By increasing the number of chaotic signals, we increase the keyspace of the encrypted information.
The Gaussian noise model serves as a foundational and widely applicable framework for analyzing signal randomness. However, it is important to recognize that while Gaussian noise is a common and versatile model, quite a few diverse noise models exist that can be useful. Examples include pink noise, brown noise, and various others, which are rather a special case of the Gaussian noise model, but require additional consideration to use them as a reference for the development of a random signal testing algorithm.

Author Contributions

Conceptualization, S.H.; methodology, S.H. and D.V.; software, S.H., E.S. and J.S.; validation, V.B. and F.C.; formal analysis, all authors; investigation, S.H., D.V., E.S. and J.S.; resources, V.B. and F.C.; data curation, S.H. and D.V.; writing and original draft preparation, all authors; visualization, all authors; supervision, V.B. and F.C.; project administration, V.B. and F.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the RRF project Latvian Quantum Technologies Initiative Nr. 2.3.1.1.i.0/1/22/I/CFLA/001.

Data Availability Statement

The data that support the findings of this study are available from the corresponding author upon reasonable request.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

Table A1, Table A2 and Table A3 present the results of passing the suggested algorithm tests, including skewness μ ˜ 3 , excess kurtosis μ ˜ 4 , and entropy power for signal k 1 , its envelope k 2 , and phase k 3 . The initial conditions for the majority of chaotic systems were randomly selected from the interval (0, 1). In cases where the chaotic mode demonstrates dependence on the initial conditions, the specific values are indicated in Table A3. Signals suitable for summation are highlighted in green, while those that successfully passed the suggested algorithm’s tests are highlighted in blue.
Table A1. Statistical properties of signals of Chua’s circuit.
Table A1. Statistical properties of signals of Chua’s circuit.
Chaotic SystemOutput
Variable
μ ˜ 3 μ ˜ 4 k 1 k 2 k 3
Chua’s circuit [49]
x ˙ = 10 ( y x f ( x ) ) x−0.0116−1.66090.36260.47540.8435
y ˙ = x y + z y−0.0028−0.14210.90390.97560.9980
z ˙ = 14.6 y z0.0084−1.11520.75410.81280.9056
where
f ( x ) = m 2 x + 0.5 ( ( m 0 m 1 ) ( | x + a 1 | | x a 1 | ) + ( m 1 m 2 ) ( | x + a 2 | | x a 2 | ) ) ;
a 1 = 1 ; a 2 = 6.88 ; m 0 = 1.238 ; m 1 = 0.6665 ; m 2 = 500 .
Pairwise sum of two signals
x 1 + x 2 0.0033−0.82870.70400.93490.9696
y 1 + y 2 0.0029−0.07170.99610.96040.9989
z 1 + z 2 −0.0007−0.55810.96480.99760.9965
Pairwise sum of three signals
x 1 + x 2 + x 3 −0.0059−0.55190.87410.88970.9873
y 1 + y 2 + y 3 0.0015−0.03670.99960.98930.9986
z 1 + z 2 + z 3 0.0089−0.37150.99010.97980.9987
Pairwise sum of four signals
x 1 + x 2 + x 3 + x 4 −0.0090−0.40880.94670.97830.9982
y 1 + y 2 + y 3 + y 4 0.0009−0.00340.99980.99080.9985
z 1 + z 2 + z 3 + z 4 0.0105−0.27000.99550.99070.9994
Experiment with Chua’s circuit
y 1 y−0.0518−0.42490.94370.93810.9950
y 1 + y 2 0.0339−0.38370.98970.91920.9986
y 1 + y 2 + y 3 0.0511−0.23930.99620.96290.9986
y 1 + y 2 + y 3 + y 4 0.0420−0.18460.99790.97200.9985
Chua’s circuit [49]
x ˙ = 9.273 ( y x f ( x ) ) x−0.0763−1.48070.54630.65320.9087
y ˙ = x y + z y−0.0070−0.93340.87390.50060.9989
z ˙ = 16.8 y 0.0042 z z0.0465−0.81640.86760.88600.9808
where
f ( x ) = m 2 x + 0.5 ( ( m 0 m 1 ) ( | x + a 1 | | x a 1 | ) + ( m 1 m 2 ) ( | x + a 2 | | x a 2 | ) ) ;
a 1 = 1 ; a 2 = 6.88 ; m 0 = 1.238 ; m 1 = 0.6665 ; m 2 = 500 .
Table A2. Statistical properties of signals of Lorenz systems.
Table A2. Statistical properties of signals of Lorenz systems.
Chaotic SystemOutput
Variable
μ ˜ 3 μ ˜ 4 k 1 k 2 k 3
Lorenz [53]
x ˙ = 10 ( y x ) x0.0003−0.70930.89890.85350.9830
y ˙ = ( 28 z ) x y y0.0005−0.15730.90130.93680.8877
z ˙ = x y 8 3 z0.2023−0.84990.89740.56180.9731
Pairwise sum of two signals
x 1 + x 2 −0.0102−0.35290.98930.95870.9995
y 1 + y 2 −0.0103−0.08010.99380.95800.9865
z 1 + z 2 0.0014−0.42910.98520.99210.9983
Pairwise sum of three signals
x 1 + x 2 + x 3 −0.0053−0.23930.99660.96770.9989
y 1 + y 2 + y 3 −0.0059−0.05700.99930.98570.9978
z 1 + z 2 + z 3 0.0397−0.28670.99460.96310.9994
Pairwise sum of four signals
x 1 + x 2 + x 3 + x 4 −0.0031−0.18400.99810.97590.9987
y 1 + y 2 + y 3 + y 4 −0.0040−0.04680.99970.99370.9999
x 1 + x 2 + x 3 + x 4 0.0002−0.21220.99750.98520.9987
Experiment with Lorenz system
x 1 x0.0131−0.59060.92920.84540.9606
x 1 + x 2 0.0150−0.19780.99370.99950.9976
x 1 + x 2 + x 3 0.0204−0.05230.99890.99960.9993
x 1 + x 2 + x 3 + x 4 0.02460.04990.99950.98860.9996
Lorenz [53]
x ˙ = 10 ( y x ) x−0.0034−0.93280.89610.75230.9649
y ˙ = ( 60 z ) x y y−0.0038−0.35190.98010.92470.8355
z ˙ = x y 8 3 z z0.0821−0.48260.97360.75150.9786
Table A3. Statistical properties of signals of chaotic systems.
Table A3. Statistical properties of signals of chaotic systems.
Chaotic SystemOutput
Variable
μ ˜ 3 μ ˜ 4 k 1 k 2 k 3
Bhalekar and Gejji [56]
x ˙ = 2.677 x y 2 x−0.4940−0.39120.87390.59240.9420
y ˙ = 10 ( z y ) y−0.0029−0.21520.93620.72050.7675
z ˙ = 27.3 y z + x y z−0.0029−0.00710.95860.91570.6919
Chen and Lee [57]
x ˙ = y z + 5 x x−0.0009−1.30130.70860.21800.9371
y ˙ = x z 10 y y0.0027−0.77110.90370.32690.8813
z ˙ = 1 3 x y 3.8 z z0.4027−0.66170.78470.53870.9838
Cheng et al. [58]
x ˙ = y x0.0042−0.72410.85440.73170.9969
y ˙ = 0.2 y ( 0.25 x sin x ) ( 10 cos 2 t + 0.1 ) y0.0002−0.63880.95400.74940.9792
Colpitts chaotic oscillator [59,60]
x ˙ = 1 C 1 ( z β f ( x ) ) x−1.33781.52710.59240.77530.7510
y ˙ = 1 C 2 ( 1 R e ( v e y ) z f ( x ) ) y−0.98970.00210.48360.61790.9102
z ˙ = 1 L ( v c e x r L z + y ) z1.01420.34890.61710.94080.8144
where C 1 = 15 × 10 9 ; C 2 = 9.7 × 10 9 ; L = 30 × 10 6 ; v e = 2 ; R e = 400 ;
β = 300 ; v c e = 7 ; r L = 40 ; f ( x ) = 0 , x 0.75 , x 0.75 200 , x > 0.75 . .
Dong et al. [61], [ x 0 , y 0 , z 0 ] = [ 0.78 , 0.52 , 0.30 ]
x ˙ = a 1 x a 2 x 2 a 3 ( y + z ) x1.314315.24550.14130.29820.7632
y ˙ = b 1 y b 2 z + b 3 x y−1.55461.46110.11390.60760.7315
z ˙ = c 1 ( z c 2 ) ( x c 3 ) z1.63611.92000.09250.61680.7312
where a 1 = 0.09 , a 2 = 0.05 , a 3 = 0.15 , b 1 = 0.06 , b 2 = 0.085 , b 3 = 0.07 ,
b 4 = 0.07 , c 1 = 0.1 , c 2 = 0.041 , 0.042
Flux controlled memristor [62]
x ˙ = 1 C 1 [ y x R r x ] x−0.01453.76630.67120.86240.9455
y ˙ = 1 C 2 [ x y R z ] y−0.00000.37480.89510.88740.9883
z ˙ = y L z0.00170.28220.87330.88350.9959
w ˙ = x ζ w−0.0916−1.87390.10060.30870.6974
where ζ = 8200 × 47 × 10 9 ; R = 2000 ; C 1 = 6.8 × 10 9 ; C 2 = 68 × 10 9 ; L = 18 × 10 3 ;
α = 0.667 × 10 3 ; β = 0.029 × 10 3 ; r = α + 3 β y 2 .
Genesio and Tesi [63,64]
x ˙ = y x0.1377−1.18670.62270.24630.9980
y ˙ = z y0.3478−1.22450.51560.10040.9931
z ˙ = a x b y c z + x 2 z0.1864−1.15140.65800.20950.9697
where a = 6 ; b = 2.92 ; c = 1.2 .
Li et al. [65]
x ˙ = 16 x + 20 y z x−0.0051−0.24850.78720.84150.8433
y ˙ = 10 y 6 x z y−0.0003−0.69390.86030.71820.9157
z ˙ = 5 z + 18 y 2 z−0.0980−0.92210.86130.79340.9360
Li and Sprott [66]
x ˙ = y z x0.0023−0.21960.85670.92770.8624
y ˙ = 1 z 2 y−0.26220.16210.95750.91520.9130
z ˙ = x + y z z0.00940.30700.96070.54930.8597
Liu and Chen [67]
x ˙ = 1.5 x y z x0.01320.92260.92410.95800.7826
y ˙ = 10 y + x z y−0.000711.77600.30500.97630.5337
z ˙ = 4 z + x y z−0.04495.01720.50130.88730.7990
Lü and Chen [68]
x ˙ = 36 ( y x ) x−0.0002−0.49490.92660.84570.8685
y ˙ = x z + 20 y y−0.0006−0.32360.94220.91080.8483
z ˙ = x y 3 z z0.2535−0.35390.94080.71140.9495
Lü et al. [69,70]
x ˙ = 0.4 x y z x0.01130.29480.93420.80410.5401
y ˙ = 12 y + x z y−0.106341.33500.00060.18840.0019
z ˙ = 5 z + x y z−0.060123.70570.00110.64880.0110
Memristive circuit [12,71]
x ˙ = y x−0.82350.03910.74550.66890.9496
y ˙ = 1 3 [ x + 1.52 ( z 2 1 ) y ] y0.49860.55980.83160.91460.8807
z ˙ = y 0.6 z + y z z−0.8277−0.25850.60460.41880.9038
Özoǧuz et al. [72]
x ˙ = y x0.0039−0.82600.88180.82300.9784
y ˙ = z y−0.0032−0.63630.93560.74800.9489
z ˙ = 0.25 ( y + z ) a f ( x ) z−0.0048−1.00100.85910.69470.9769
where f ( x ) = j = 3 5 ( 1 ) j 1 tanh k ( x 2 j ) .
Qi et al. [73]
x ˙ = 14 ( y x ) + 4 y z x−0.03130.64210.95620.88120.9000
y ˙ = x + 16 y x z y0.01580.92690.95540.92380.9044
z ˙ = 43 z + x y z0.03754.19040.75270.85280.9239
Ring oscillating systems [74]
x ˙ = α ( M f ( z ) x ) x−0.0003−0.77340.89920.73330.9900
y ˙ = 4 π 2 ( x z ) y0.0012−0.51550.96190.96430.9762
z ˙ = y β z z0.0014−1.14980.79920.71240.9259
where α = 2.1 ; β = 1.38 ; M = 5 ; f ( z ) = | z + 1 | | z 1 | + 0.5 ( | z 4 | | z + 4 | ) .
Rössler [75]
x ˙ = y z x0.2261−0.71200.87090.56200.9958
y ˙ = x + 0.2 y y−0.1768−0.81740.85650.58950.9958
z ˙ = 0.2 + z ( x 6.5 ) z5.335931.44570.00070.18690.4920
Sprott [76], system A
x ˙ = y x0.44570.14070.72330.88020.9472
y ˙ = x + y z y0.00040.60150.93360.80520.8718
z ˙ = 1 y 2 z−0.0003−0.76920.93570.54460.9792
Sprott [76], system B
x ˙ = y z x−0.08540.64610.94880.98820.8560
y ˙ = x y y−0.0859−0.49760.92650.79670.9309
z ˙ = 1 x y z0.05501.04850.95730.95510.9124
Sprott [76], system C
x ˙ = y z x−0.0285−0.18910.96700.96180.9479
y ˙ = x y y−0.0333−0.98040.85820.83410.9715
z ˙ = 1 x 2 z−0.60703.61330.88160.61430.9590
Sprott [76], system D, [ x 0 , y 0 , z 0 ] = [ 0.05 , 0.05 , 0.05 ]
x ˙ = y x−1.46871.74510.51220.93020.8719
y ˙ = x + z y−0.21640.44220.89080.90150.9176
z ˙ = x z + 3 y 2 z1.44791.80390.52150.86280.9014
Sprott [76], system E
x ˙ = y z x0.44230.74100.86250.61110.8678
y ˙ = x 2 y y7.8746203.44640.23250.43600.8765
z ˙ = 1 4 x z−0.2077−1.13660.70000.39840.9822
Sprott [76], system F, [ x 0 , y 0 , z 0 ] = [ 0.3196 , 0.4268 , 0.5159 ]
x ˙ = y + z x−0.2414−0.36010.93740.87120.9195
y ˙ = x + 0.5 y y−0.7451−0.41050.68650.84760.9080
z ˙ = x 2 z z1.54881.98610.35280.71150.8282
Sprott [76], system G, [ x 0 , y 0 , z 0 ] = [ 1.0755 , 0.0291 , 0.0274 ]
x ˙ = 0.4 x + z x−0.4155−0.47380.75840.62930.8725
y ˙ = x z y y−1.31711.93180.51370.75440.8240
z ˙ = x + y z−0.2177−0.43420.80680.86140.9355
Sprott [76], system H, [ x 0 , y 0 , z 0 ] = [ 0.9767 , 0.6578 , 0.1281 ]
x ˙ = y + z 2 x−0.90671.05920.82590.89430.9268
y ˙ = x + 0.5 y y0.88460.18700.72360.88970.9088
z ˙ = x z z−0.2380−0.35830.93740.87530.9163
Sprott [76], system I, [ x 0 , y 0 , z 0 ] = [ 0.05 , 0.05 , 0.05 ]
x ˙ = 0.2 y x−0.6289−0.63970.57270.58880.9878
y ˙ = x + z y−0.4225−0.83210.70320.33280.9710
z ˙ = x + y 2 z z−0.13940.19850.70510.86960.8300
Sprott [76], system J
x ˙ = 2 z x0.6591−0.55380.62680.63590.9792
y ˙ = 2 y + z y−0.4453−0.73070.79340.51900.9716
z ˙ = x + y + y 2 z−0.7874−0.21110.70260.56750.9482
Sprott [76], system K
x ˙ = x y z x−0.6564−0.14590.82330.54260.9263
y ˙ = x y y−0.1882−0.85070.86530.54300.9624
z ˙ = x + 0.3 z z0.96670.13610.57520.67750.9612
Sprott [76], system L, [ x 0 , y 0 , z 0 ] = [ 7.3474 , 30.4894 , 5.4293 ]
x ˙ = y + 3.9 z x−0.4581−1.00740.62980.28810.9741
y ˙ = 0.9 x 2 y y0.6651−0.48000.68650.78030.9235
z ˙ = 1 x z−0.4601−0.49520.69500.63310.9728
Sprott [76], system M, [ x 0 , y 0 , z 0 ] = [ 1.6768 , 0.8718 , 1.4698 ]
x ˙ = z x0.1887−1.07760.66890.45270.9901
y ˙ = x 2 y y−1.02210.24970.57540.79640.8224
z ˙ = 1.7 + 1.7 x + y z−0.6044−0.78470.60110.28160.9553
Sprott [76], system N
x ˙ = 2 y x−0.6613−0.55370.62470.64830.9790
y ˙ = x z 2 y−0.7877−0.20740.70060.55770.9483
z ˙ = 1 + y 2 z z−0.4452−0.72780.79120.51510.9716
Sprott [76], system O, [ x 0 , y 0 , z 0 ] = [ 0.4120 , 0.5758 , 0.7232 ]
x ˙ = y x−0.1672−0.98030.73620.47250.9929
y ˙ = x z y−0.3632−1.10610.56900.24670.9963
z ˙ = x + x z + 2.7 y z−0.0199−1.14390.71980.29280.9920
Sprott [76], system P, [ x 0 , y 0 , z 0 ] = [ 0.0115 , 0.5545 , 0.2078 ]
x ˙ = 2.7 y + z x0.91970.18770.71370.93580.9261
y ˙ = x + y 2 y−0.2534−0.59630.88940.88620.9202
z ˙ = x + y z0.7941−0.16430.70970.84490.8992
Sprott [76], system Q
x ˙ = z x−0.4461−0.10580.82240.88590.9232
y ˙ = x y y−0.3738−0.63330.79440.78590.9237
z ˙ = 3.1 x + y 2 + 0.5 z z0.68200.14000.76500.86230.9857
Sprott [76], system R
x ˙ = 0.9 y x−0.4423−0.41400.87970.64560.9681
y ˙ = 0.4 + z y0.81240.95270.81160.50350.8950
z ˙ = x y z z−1.90406.03130.48990.77030.6918
Sprott [76], system S
x ˙ = x 4 y x−0.5469−0.57270.76230.63490.9775
y ˙ = x + z 2 y0.5628−0.44120.73840.81450.9541
z ˙ = 1 + x z−0.4298−0.72530.79860.74160.9527
Wu and Wang [77], [ x 0 , y 0 , z 0 ] = [ 0 , 0 , 0 ]
0.2 x + y x−0.3147−1.03860.74340.38870.9940
1 3 ( x z 2 y ) y0.4113−0.74590.80990.44520.9695
0.4 y 0.4 z + y z z−1.06750.04210.38940.62620.9119
Zhang et al. [78]
x ˙ = y x−0.0022−0.40240.88030.74670.9745
y ˙ = x ( 1 + z + 2 z 2 ) y y0.0166−0.15660.92390.65190.9363
z ˙ = 2 z + ( 0.5 + z + 2 z 2 ) y 2 z1.86482.99390.24490.79470.8099

References

  1. Moon, F.C. Chaotic and Fractal Dynamics: Introduction for Applied Scientists and Engineers; John Wiley & Sons: Hoboken, NJ, USA, 2008. [Google Scholar]
  2. Kiel, L.D.; Elliott, E.W. Chaos Theory in the Social Sciences: Foundations and Applications; University of Michigan Press: Ann Arbor, MI, USA, 1997. [Google Scholar]
  3. Turner, J.R.; Baker, R.M. Complexity Theory: An Overview with Potential Applications for the Social Sciences. Systems 2019, 7, 4. [Google Scholar] [CrossRef]
  4. Scharf, Y. A chaotic outlook on biological systems. Chaos Solitons Fractals 2017, 95, 42–47. [Google Scholar] [CrossRef]
  5. Fernández-Díaz, A. Overview and Perspectives of Chaos Theory and Its Applications in Economics. Mathematics 2023, 12, 92. [Google Scholar] [CrossRef]
  6. Biswas, H.R.; Hasan, M.M.; Bala, S.K. Chaos theory and its applications in our real life. Barishal Univ. J. Part 2018, 1, 123–140. [Google Scholar]
  7. Vasyuta, K.; Zots, F.; Zakharchenko, I. Building the air defense covert information and measuring system based on orthogonal chaotic signals. Innov. Technol. Sci. Solut. Ind. 2019, 4, 33–43. [Google Scholar] [CrossRef]
  8. Macovei, C.; Răducanu, M.; Datcu, O. Image Encryption Algorithm Using Wavelet Packets and Multiple Chaotic Maps. In Proceedings of the 2020 International Symposium on Electronics and Telecommunications (ISETC), Timisoara, Romania, 5–6 November 2020; pp. 1–4. [Google Scholar] [CrossRef]
  9. Kushnir, M.; Vovchuk, D.; Haliuk, S.; Ivaniuk, P.; Politanskyi, R. Approaches to Building a Chaotic Communication System. In Data-Centric Business and Applications: ICT Systems-Theory, Radio-Electronics, Information Technologies and Cybersecurity; Springer International Publishing: Cham, Switzerland, 2021; Volume 5, pp. 207–227. [Google Scholar] [CrossRef]
  10. Kocarev, L.; Lian, S. Chaos-Based Cryptography: Theory, Algorithms and Applications; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2011; Volume 354. [Google Scholar] [CrossRef]
  11. Cang, S.; Kang, Z.; Wang, Z. Pseudo-random number generator based on a generalized conservative Sprott-A system. Nonlinear Dyn. 2021, 104, 827–844. [Google Scholar] [CrossRef]
  12. Haliuk, S.; Krulikovskyi, O.; Vovchuk, D.; Corinto, F. Memristive Structure-Based Chaotic System for PRNG. Symmetry 2022, 14, 68. [Google Scholar] [CrossRef]
  13. Kushnir, M.; Haliuk, S.; Rusyn, V.; Kosovan, H.; Vovchuk, D. Computer Modeling of Information Properties of Deterministic Chaos. In Proceedings of the CHAOS 2014—Proceedings: 7th Chaotic Modeling and Simulation International Conference, Lisbon, Portugal, 7–10 June 2014; pp. 265–276. [Google Scholar]
  14. Kushnir, M.; Ivaniuk, P.; Vovchuk, D.; Galiuk, S. Information Security of the Chaotic Communication Systems. In Proceedings of the CHAOS 2015—8th Chaotic Modeling and Simulation International Conference, Paris, France, 26–29 May 2015; pp. 441–452. [Google Scholar]
  15. Wang, Y.; Liu, Z.; Zhang, L.Y.; Pareschi, F.; Setti, G.; Chen, G. From chaos to pseudorandomness: A case study on the 2-D coupled map lattice. IEEE Trans. Cybern. 2023, 53, 1324–1334. [Google Scholar] [CrossRef] [PubMed]
  16. Cover, T.; Thomas, J.A. Elements of Information Theory; Wiley-Interscience: Hoboken, NJ, USA, 2006. [Google Scholar]
  17. Eisencraft, M.; Monteiro, L.H.A.; Soriano, D.C. White Gaussian Chaos. IEEE Commun. Lett. 2017, 21, 1719–1722. [Google Scholar] [CrossRef]
  18. Mliki, E.; Hasanzadeh, N.; Nazarimehr, F.; Akgul, A.; Boubaker, O.; Jafari, S. Some New Chaotic Maps With Application in Stochastic. In Recent Advances in Chaotic Systems and Synchronization; Boubaker, O., Jafari, S., Eds.; Emerging Methodologies and Applications in Modelling; Academic Press: Cambridge, MA, USA, 2019; pp. 165–185. [Google Scholar] [CrossRef]
  19. Rovatti, R.; Setti, G.; Callegari, S. Limit properties of folded sums of chaotic trajectories. IEEE Trans. Circuits Syst. Fundam. Theory Appl. 2002, 49, 1736–1744. [Google Scholar] [CrossRef]
  20. Kilias, T.; Kelber, K.; Mogel, A.; Schwarz, W. Electronic chaos generators—Design and applications. Int. J. Electron. 1995, 79, 737–753. [Google Scholar] [CrossRef]
  21. Liu, J.D.; Kai, Y.; Wang, S.H. Coupled Chaotic Tent Map Lattices System with Uniform Distribution. In Proceedings of the 2010 2nd International Conference on E-Business and Information System Security, Wuhan, China, 22–23 May 2010; pp. 1–5. [Google Scholar] [CrossRef]
  22. Li, P.; Li, Z.; Halang, W.A.; Chen, G. A stream cipher based on a spatiotemporal chaotic system. Chaos Solitons Fractals 2007, 32, 1867–1876. [Google Scholar] [CrossRef]
  23. Espinel, A.; Taralova, I.; Lozi, R. New alternate ring-coupled map for multi-random number generation. J. Nonlinear Syst. Appl. 2013, 4, 64–69. [Google Scholar]
  24. Haliuk, S.; Krulikovskyi, O.; Politanskyi, L. Analysis of time series generated by Tratas chaotic system. Her. Khmelnytskyi Natl. Univ. 2017, 251, 187–192. [Google Scholar]
  25. Haliuk, S.; Krulikovskyi, O.; Politanskyi, L.; Corinto, F. Circuit implementation of Lozi ring-coupled map. In Proceedings of the 2017 4th International Scientific-Practical Conference Problems of Infocommunications, Kharkov, Ukraine, 10–13 October 2017; Science and Technology (PIC S&T). IEEE: Piscataway, NJ, USA, 2017; pp. 249–252. [Google Scholar] [CrossRef]
  26. Naruse, M.; Kim, S.J.; Aono, M.; Hori, H.; Ohtsu, M. Chaotic oscillation and random-number generation based on nanoscale optical-energy transfer. Sci. Rep. 2014, 4, 6039. [Google Scholar] [CrossRef] [PubMed]
  27. Elsonbaty, A.; Hegazy, S.F.; Obayya, S.S.A. Numerical analysis of ultrafast physical random number generator using dual-channel optical chaos. Opt. Eng. 2016, 55, 094105. [Google Scholar] [CrossRef]
  28. Yoshiya, K.; Terashima, Y.; Kanno, K.; Uchida, A. Entropy evaluation of white chaos generated by optical heterodyne for certifying physical random number generators. Opt. Express 2020, 28, 3686–3698. [Google Scholar] [CrossRef] [PubMed]
  29. Kawaguchi, Y.; Okuma, T.; Kanno, K.; Uchida, A. Entropy rate of chaos in an optically injected semiconductor laser for physical random number generation. Opt. Express 2021, 29, 2442–2457. [Google Scholar] [CrossRef] [PubMed]
  30. Baby, H.T.; Sujatha, B.R. Optical Chaos KEY generator for Cryptosystems. J. Phys. Conf. Ser. 2021, 1767, 012046. [Google Scholar] [CrossRef]
  31. Nguyen, N.; Kaddoum, G.; Pareschi, F.; Rovatti, R.; Setti, G. A fully CMOS true random number generator based on hidden attractor hyperchaotic system. Nonlinear Dyn. 2020, 102, 2887–2904. [Google Scholar] [CrossRef]
  32. Guo, Y.; Li, H.; Wang, Y.; Meng, X.; Zhao, T.; Guo, X. Chaos with Gaussian invariant distribution by quantum-noise random phase feedback. Opt. Express 2023, 19, 31522–31532. [Google Scholar] [CrossRef]
  33. Fadil, E.; Abass, A.; Tahhan, S. Secure WDM-free space optical communication system based optical chaotic. Opt. Quantum Electron. 2022, 54, 477. [Google Scholar] [CrossRef]
  34. Wang, L.; Mao, X.; Wang, A.; Wang, Y.; Gao, Z.; Li, S.; Yan, L. Scheme of coherent optical chaos communication. Opt. Lett. 2020, 45, 4762–4765. [Google Scholar] [CrossRef] [PubMed]
  35. Liu, B.C.; Xie, Y.Y.; Zhang, Y.S.; Ye, Y.C.; Song, T.T.; Liao, X.F.; Liu, Y. ARM-Embedded Implementation of a Novel Color Image Encryption and Transmission System Based on Optical Chaos. IEEE Photonics J. 2020, 12, 1–17. [Google Scholar] [CrossRef]
  36. Shakeel, I.; Hilliard, J.; Zhang, W.; Rice, M. Gaussian-Distributed Spread-Spectrum for Covert Communications. Sensors 2023, 23, 4081. [Google Scholar] [CrossRef] [PubMed]
  37. Negi, R.; Goel, S. Secret Communication Using Artificial Noise. In Proceedings of the VTC-2005-Fall. 2005 IEEE 62nd Vehicular Technology Conference, Dallas, TX, USA, 28 September 2005; Volume 3, pp. 1906–1910. [Google Scholar] [CrossRef]
  38. Zhou, X.; McKay, M.R. Secure Transmission with Artificial Noise Over Fading Channels: Achievable Rate and Optimal Power Allocation. IEEE Trans. Veh. Technol. 2010, 59, 3831–3842. [Google Scholar] [CrossRef]
  39. Nguyen, L.L.; Nguyen, T.T.; Fiche, A.; Gautier, R.; Ta, H.Q. Hiding Messages in Secure Connection Transmissions with Full-Duplex Overt Receiver. Sensors 2022, 22, 5812. [Google Scholar] [CrossRef] [PubMed]
  40. Yang, W.; Lu, X.; Yan, S.; Shu, F.; Li, Z. Age of Information for Short-Packet Covert Communication. IEEE Wirel. Commun. Lett. 2021, 10, 1890–1894. [Google Scholar] [CrossRef]
  41. Anderson, D.F.; Seppäläinen, T.; Valkó, B. Introduction to Probability; Cambridge University Press: Cambridge, UK, 2017. [Google Scholar]
  42. Athreya, K.B.; Lahiri, S.N. Measure Theory and Probability Theory; Springer: Berlin/Heidelberg, Germany, 2006; Volume 19. [Google Scholar]
  43. Thode, H.C. Testing for Normality, 1st ed.; Statistics: Textbooks and Monographs 164; Marcel Dekker: New York, NY, USA, 2002. [Google Scholar]
  44. Michalowicz, J.V.; Nichols, J.M.; Bucholtz, F. Handbook of Differential Entropy; CRC Press: Boca Raton, FL, USA, 2013. [Google Scholar]
  45. Krasil’nikov, A.I. Class of non-Gaussian distributions with zero skewness and kurtosis. Radioelectron. Commun. Syst. 2013, 56, 312–320. [Google Scholar] [CrossRef]
  46. Kschischang, F.R. The Hilbert Transform; University of Toronto: Toronto, ON, Canada, 2006. [Google Scholar]
  47. Shannon, C.E. A mathematical theory of communication. Bell Syst. Tech. J. 1948, 27, 379–423. [Google Scholar] [CrossRef]
  48. Kullback, S.; Leibler, R.A. On information and sufficiency. Ann. Math. Stat. 1951, 22, 79–86. [Google Scholar] [CrossRef]
  49. Matsumoto, T.; Chua, L.; Komuro, M. The double scroll. IEEE Trans. Circuits Syst. 1985, 32, 797–818. [Google Scholar] [CrossRef]
  50. Zhong, G.Q. Implementation of Chua’s circuit with a cubic nonlinearity. IEEE Trans. Circuits Syst. Fundam. Theory Appl. 1994, 41, 934–941. [Google Scholar] [CrossRef]
  51. Shi, Z.; Ran, L. Tunnel Diode Based Chua’s Circuit. In Proceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication (IEEE Cat. No.04EX710), Shanghai, China, 31 May–2 June 2004; Volume 1, pp. 217–220. [Google Scholar] [CrossRef]
  52. Kennedy, M.P. Robust op amp realization of Chua’s circuit. Frequenz 1992, 46, 66–80. [Google Scholar] [CrossRef]
  53. Lorenz, E.N. Deterministic nonperiodic flow. J. Atmos. Sci. 1963, 20, 130–141. [Google Scholar] [CrossRef]
  54. Pappu, C.S.; Flores, B.C.; Debroux, P.S.; Boehm, J.E. An Electronic Implementation of Lorenz Chaotic Oscillator Synchronization for Bistatic Radar Applications. IEEE Trans. Aerosp. Electron. Syst. 2017, 53, 2001–2013. [Google Scholar] [CrossRef]
  55. Horowitz, P. Build a Lorenz Attractor; Harvard University: Cambridge, MA, USA, 2003. [Google Scholar]
  56. Bhalekar, S.; Daftardar-Gejji, V. A New Chaotic Dynamical System and Its Synchronization. In Proceedings of the International Conference on Mathematical Sciences in Honor of Prof. AM Mathai, Palai, India, 3–5 January 2011; pp. 3–5. [Google Scholar]
  57. Chen, H.K.; Lee, C.I. Anti-control of chaos in rigid body motion. Chaos Solitons Fractals 2004, 21, 957–965. [Google Scholar] [CrossRef]
  58. Cheng, G.; Li, D.; Yao, Y.; Gui, R. Multi-scroll chaotic attractors with multi-wing via oscillatory potential wells. Chaos Solitons Fractals 2023, 174, 113837. [Google Scholar] [CrossRef]
  59. Dmitriev, A.; Panas, A. Dynamic Chaos: New Data Carrying Media for Communication Systems; Fismatlit: Moscow, Russia, 2002. (In Russian) [Google Scholar]
  60. Semenov, A. Reviewing the Mathemetical Models and Electrical Circuits of Deterministic Chaos Transistor Oscillators. In Proceedings of the 2016 International Siberian Conference on Control and Communications (SIBCON), Moscow, Russia, 12–14 May 2016; pp. 1–6. [Google Scholar] [CrossRef]
  61. Dong, G.; Du, R.; Tian, L.; Jia, Q. A novel 3D autonomous system with different multilayer chaotic attractors. Phys. Lett. A 2009, 373, 3838–3845. [Google Scholar] [CrossRef]
  62. Muthuswamy, B. Implementing memristor based chaotic circuits. Int. J. Bifurc. Chaos 2010, 20, 1335–1350. [Google Scholar] [CrossRef]
  63. Genesio, R.; Tesi, A. Harmonic balance methods for the analysis of chaotic dynamics in nonlinear systems. Automatica 1992, 28, 531–548. [Google Scholar] [CrossRef]
  64. Park, J.H. Synchronization of Genesio chaotic system via backstepping approach. Chaos Solitons Fractals 2006, 27, 1369–1375. [Google Scholar] [CrossRef]
  65. Li, C.; Li, H.; Tong, Y. Analysis of a novel three-dimensional chaotic system. Optik 2013, 124, 1516–1522. [Google Scholar] [CrossRef]
  66. Li, C.; Sprott, J.C. Variable-boostable chaotic flows. Optik 2016, 127, 10389–10398. [Google Scholar] [CrossRef]
  67. Liu, W.; Chen, G. A new chaotic system and its generation. Int. J. Bifurc. Chaos 2003, 13, 261–267. [Google Scholar] [CrossRef]
  68. LÜ, J.; Chen, G. A new chaotic attractor coined. Int. J. Bifurc. Chaos 2002, 12, 659–661. [Google Scholar] [CrossRef]
  69. Lü, J.; Chen, G.; Cheng, D. A new chaotic system and beyond: The generalized lorenz-like system. Int. J. Bifurc. Chaos 2004, 14, 1507–1537. [Google Scholar] [CrossRef]
  70. Huang, J.; Xiao, T.J. Chaos synchronizations of chaotic systems via active nonlinear control. J. Phys. Conf. Ser. 2008, 96, 012177. [Google Scholar] [CrossRef]
  71. Muthuswamy, B.; Chua, L.O. Simplest chaotic circuit. Int. J. Bifurc. Chaos 2010, 20, 1567–1580. [Google Scholar] [CrossRef]
  72. Özoguz, S.; Elwakil, A.; Salama, K.N. N-scroll chaos generator using nonlinear transconductor. Electron. Lett. 2002, 38, 1. [Google Scholar] [CrossRef]
  73. Qi, G.; Chen, G.; van Wyk, M.A.; van Wyk, B.J.; Zhang, Y. A four-wing chaotic attractor generated from a new 3-D quadratic autonomous system. Chaos Solitons Fractals 2008, 38, 705–721. [Google Scholar] [CrossRef]
  74. Haliuk, S.; Kushnir, M.; Politanskyi, L.; Politanskyi, R. Synchronization of chaotic systems and signal filtration in the communication channel. East.-Eur. J. Enterp. Technol. 2012, 1, 20–24. [Google Scholar]
  75. Rössler, O.E. An equation for continuous chaos. Phys. Lett. A 1976, 57, 397–398. [Google Scholar] [CrossRef]
  76. Sprott, J.C. Some simple chaotic flows. Phys. Rev. E 1994, 50, R647. [Google Scholar] [CrossRef] [PubMed]
  77. Wu, R.; Wang, C. A New Simple Chaotic Circuit Based on Memristor. Int. J. Bifurc. Chaos 2016, 26, 1650145. [Google Scholar] [CrossRef]
  78. Zhang, X.; Tian, Z.; Li, J.; Cui, Z. A Simple Parallel Chaotic Circuit Based on Memristor. Entropy 2021, 23, 719. [Google Scholar] [CrossRef]
Figure 1. Schematic representation of the suggested algorithm for forming Gaussian-distributed signals. Simple chaotic systems with different initial conditions and/or system parameters suffer normalization (an optional stage depending on the conditions) and are added in the summation block. The number of chaotic systems (n) can vary until the output signal successfully passes the suggested algorithm’s tests, resulting in the achievement of a Gaussian-distributed signal.
Figure 1. Schematic representation of the suggested algorithm for forming Gaussian-distributed signals. Simple chaotic systems with different initial conditions and/or system parameters suffer normalization (an optional stage depending on the conditions) and are added in the summation block. The number of chaotic systems (n) can vary until the output signal successfully passes the suggested algorithm’s tests, resulting in the achievement of a Gaussian-distributed signal.
Electronics 13 01387 g001
Figure 2. Chua’s circuit.
Figure 2. Chua’s circuit.
Electronics 13 01387 g002
Figure 3. The PDFs of the sum of n chaotic signals generated by Chua’s circuit: PDF of signals (ad), PDF of envelope of signals (eh), PDF of the phase of signals (il).
Figure 3. The PDFs of the sum of n chaotic signals generated by Chua’s circuit: PDF of signals (ad), PDF of envelope of signals (eh), PDF of the phase of signals (il).
Electronics 13 01387 g003
Figure 4. Quality metrics of the sum of n signals x, z generated by Chua’s circuit for different n: excess kurtosis (a), entropy power of the amplitude of signals (b), entropy power of the envelope of signals (c) and entropy power of the phase of signals (d).
Figure 4. Quality metrics of the sum of n signals x, z generated by Chua’s circuit for different n: excess kurtosis (a), entropy power of the amplitude of signals (b), entropy power of the envelope of signals (c) and entropy power of the phase of signals (d).
Electronics 13 01387 g004
Figure 5. Electronic implementation of a Lorenz system.
Figure 5. Electronic implementation of a Lorenz system.
Electronics 13 01387 g005
Figure 6. The PDFs of the sum of n chaotic signals generated by a Lorenz circuit: PDF of signals (ad), PDF of envelope of signals (eh), PDF of the phase of signals (il).
Figure 6. The PDFs of the sum of n chaotic signals generated by a Lorenz circuit: PDF of signals (ad), PDF of envelope of signals (eh), PDF of the phase of signals (il).
Electronics 13 01387 g006
Figure 7. Quality metrics of the sum of n signals x, y, and z generated by a Lorenz circuit for different n: excess kurtosis (a), entropy power of the amplitude of signals (b), entropy power of the envelope of signals (c) and entropy power of the phase of signals (d).
Figure 7. Quality metrics of the sum of n signals x, y, and z generated by a Lorenz circuit for different n: excess kurtosis (a), entropy power of the amplitude of signals (b), entropy power of the envelope of signals (c) and entropy power of the phase of signals (d).
Electronics 13 01387 g007
Figure 8. The experimental PDFs of the sum of n chaotic signals generated by a prototype of Chua’s circuit: PDF of signals (ad), PDF of envelope of signals (eh), PDF of the phase of signals (il).
Figure 8. The experimental PDFs of the sum of n chaotic signals generated by a prototype of Chua’s circuit: PDF of signals (ad), PDF of envelope of signals (eh), PDF of the phase of signals (il).
Electronics 13 01387 g008
Figure 9. The experimental PDFs of the sum of n chaotic signals generated by a prototype of a Lorenz circuit: PDF of signals (ad), PDF of envelope of signals (eh), PDF of the phase of signals (il).
Figure 9. The experimental PDFs of the sum of n chaotic signals generated by a prototype of a Lorenz circuit: PDF of signals (ad), PDF of envelope of signals (eh), PDF of the phase of signals (il).
Electronics 13 01387 g009
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Haliuk, S.; Vovchuk, D.; Spinazzola, E.; Secco, J.; Bobrovs, V.; Corinto, F. A Deterministic Chaos-Model-Based Gaussian Noise Generator. Electronics 2024, 13, 1387. https://doi.org/10.3390/electronics13071387

AMA Style

Haliuk S, Vovchuk D, Spinazzola E, Secco J, Bobrovs V, Corinto F. A Deterministic Chaos-Model-Based Gaussian Noise Generator. Electronics. 2024; 13(7):1387. https://doi.org/10.3390/electronics13071387

Chicago/Turabian Style

Haliuk, Serhii, Dmytro Vovchuk, Elisabetta Spinazzola, Jacopo Secco, Vjaceslavs Bobrovs, and Fernando Corinto. 2024. "A Deterministic Chaos-Model-Based Gaussian Noise Generator" Electronics 13, no. 7: 1387. https://doi.org/10.3390/electronics13071387

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop