Related papers: Logistic Map: A Possible Random Number Generator

Many popular video games use pseudorandom number generators to create randomly distributed locations for game objects as highly unpredictable as possible. Some scenarios like game competition also need reproducible randomness, namely the…

We discuss two properties making a deterministic algorithm suitable to generate a pseudo random sequence of numbers: high value of Kolmogorov-Sinai entropy and high-dimensionality. We propose the multi dimensional Anosov symplectic (cat)…

The chaotic systems have been found applications in diverse fields such as pseudo random number generator, coding, cryptography, spread spectrum (SS) communications etc. The inherent capability of generating a large space of PN sequences…

A generalized method is proposed to compose new orbits from a given chaotic map. The method provides an approach to examine discrete-time chaotic maps in a "deep-zoom" manner by using $k$-digits to the right from the decimal separator of a…

A 1-dimensional generalization of the well known Logistic Map is proposed. The proposed family of maps is referred to as the B-Exponential Map. The dynamics of this map are analyzed and found to have interesting properties. In particular,…

In previous work, the $k$-logistic map [Machicao and Bruno, Chaos, vol. 27, 053116 (2017)] was introduced as a transformation operating in the $k$ less significant digits of the Logistic map. It exploited the map's pseudo-randomness…

Chaotic behavior arises from very simple non-linear dynamical equation of logistic map which makes it was used often in designing chaotic image encryption schemes. However, some properties of chaotic maps can also facilitate cryptanalysis…

Chaotic dynamics is widely used to design pseudo-random number generators and for other applications such as secure communications and encryption. This paper aims to study the dynamics of discrete-time chaotic maps in the digital (i.e.,…

This project develops a pseudo-random number generator (PRNG) using the logistic map, implemented in Verilog HDL on an FPGA and processes its output through a Central Limit Theorem (CLT) function to achieve a Gaussian distribution. The…

This paper explores the deep-zoom properties of the chaotic k-logistic map, in order to propose an improved chaos-based cryptosystem. This map was shown to enhance the random features of the Logistic map, while at the same time reducing the…

In this paper we investigate a fractional order logistic map and its discrete time dynamics. We show some basic properties of the fractional logistic map and numerically study its period-doubling route to chaos.

Pseudo-Random Bit Generation (PRBG) is required in many aspects of cryptography as well as in other applications of modern security engineering. In this work, PRBG based on 2D symmetrical chaotic mappings of logistic type is considered. The…

This paper analyzes the use of the logistic map for cryptographic applications. The most important characteristics of the logistic map are shown in order to prove the inconvenience of considering this map in the design of new chaotic…

The full family of discrete logistic maps has been widely studied both as a canonical example of the period-doubling route to chaos, and as a model of natural processes. In this paper we present a study of the stochastic process described…

Several efforts have been seen claiming the lightweight block ciphers as a necessarily suitable substitute in securing the Internet of Things. Currently, it has been able to envisage as a pervasive frame of reference almost all across the…

Chaos is popularly associated with its property of sensitivity to initial conditions. In this paper we will show that there can be a flip side to this property which is quite fascinating and highly useful in many applications. As a result,…

We proposed the deep zoom analysis of the composition of the logistic map and the tent map, which are well-known discrete unimodal chaotic maps. The deep zoom technique transforms each point of a given chaotic orbit by removing its first…

This article describes a new family of cryptographically secure pseudorandom number generators, based on coupled chaotic maps, that will serve as keystream in a stream cipher. The maps are a modification of a piecewise linear map, by…

We deal with randomness-quantifiers and concentrate on their ability do discern the hallmark of chaos in time-series used in connection with pseudo random number generators (PRNG). Workers in the field are motivated to use chaotic maps for…

A random number generator is proposed based on a theorem about existence of chaos in fixed point iteration of x= cot2(x). Digital computer simulation of this function iteration exhibits random behavior. A method is proposed to extract…