Related papers: Improving the pseudo-randomness properties of chao…
In this paper, we investigate theoretically the potential of a nanoelectromechanical suspended beam resonator excited by two-external frequencies as a hardware random number generator (HRNG). This system exhibits robust chaos, which is…
We present a detailed algorithm to construct symbolic encodings for chaotic attractors of three-dimensional flows. It is based on a topological analysis of unstable periodic orbits embedded in the attractor and follows the approach proposed…
Classical chaotic systems with symbolic dynamics but strong pruning present a particular challenge for the application of semiclassical quantization methods. In the present study we show that the technique of periodic orbit quantization by…
A scheme for pseudo-random binary sequence generation based on the two-dimensional discrete-time Henon map is proposed. Properties of the proposed sequences pertaining to linear complexity, linear complexity profile, correlation and…
Recently, we introduced a new test for distinguishing regular from chaotic dynamics in deterministic dynamical systems and argued that the test had certain advantages over the traditional test for chaos using the maximal Lyapunov exponent.…
Identifying the types of orbits is an important topic in the study of chaotic dynamical systems. Beyond the well-known distinctly chaotic and regular motions, we focus on dynamics occurring in regions where regular and chaotic motions…
Stochasticity is ubiquitous in the world around us. However, our predominant computing paradigm is deterministic. Random number generation (RNG) can be a computationally inefficient operation in this system especially for larger workloads.…
Random number generators (RNG) based on quantum mechanics are captivating due to their security and unpredictability compared to conventional generators, such as pseudo-random number generators and hardware-random number generators. This…
Despite many of the most common chaotic dynamical systems being continuous in time, it is through discrete time mappings that much of the understanding of chaos is formed. Henri Poincar\'e first made this connection by tracking consecutive…
Nowadays random number generation plays an essential role in technology with important applications in areas ranging from cryptography, which lies at the core of current communication protocols, to Monte Carlo methods, and other…
The parallel computational complexity of the quadratic map is studied. A parallel algorithm is described that generates typical pseudotrajectories of length t in a time that scales as log t and increases slowly in the accuracy demanded of…
Last two decades, the problem of robotic mapping has made a lot of progress in the research community. However, since the data provided by the sensor still contains noise, how to obtain an accurate map is still an open problem. In this…
This study explores the application of random matrices to track chaotic dynamics within the Chirikov standard map. Our findings highlight the potential of matrices exhibiting Wishart-like characteristics, combined with statistical insights…
Sub-categories of mathematical topology, like the mathematical theory of chaos, offer interesting applications devoted to information security. In this research work, we have introduced a new chaos-based pseudorandom number generator…
We revisit Nisan's classical pseudorandom generator (PRG) for space-bounded computation (STOC 1990) and its applications in streaming algorithms. We describe a new generator, HashPRG, that can be thought of as a symmetric version of Nisan's…
In recent years, a lot of research has gone into creating multi-layer chaotic mapping-based cryptosystems. Random-like behavior, a continuous broadband power spectrum, and a weak baseline condition dependency are all characteristics of…
A class of numerical methods to determine Pollicott-Ruelle resonances in chaotic dynamical systems is proposed. This is achieved by relating some existing procedures which make use of Pade approximants and interpolating exponentials to both…
Guaranteeing the security of information transmitted through the Internet, against passive or active attacks, is a major concern. The discovery of new pseudo-random number generators with a strong level of security is a field of research in…
Ideal quantum random number generators (QRNGs) can produce algorithmically random and thus incomputable sequences, in contrast to pseudo-random number generators. However, the verification of the presence of algorithmic randomness and…
This paper conducts a comparative study of three IoT-based PRNG models, including Logistic Map, Double Pendulum, and Multi-LFSR, implemented on an FPGA platform. Comparisons are made across key performance metrics like randomness, latency,…