A cascade function is designed by combining two seed maps that resultantly has more parameters, high complexity, randomness, and unpredictable behavior. In the paper, a fractal function, i.e. cascade-PLMS proposed considering phoenix lambda functions. The constructed exhibits required features such as fractional dimension, self-similar structure, covering entire phase space data sequence in add...

We present a pseudo random bit generator whose security is based on the intractability of the discrete logarithm problem in the group E(Fp) of rational points on an elliptic curve over a finite prime field Fp. The bit generator is implemented within the framework of the Java Cryptography Architecture (JCA). It uses an elliptic curve E chosen such that both E(Fp) and its twist E (Fp) are of prim...

This article describes a method to turn astronomical imaging into a random number generator by using the positions of incident cosmic rays and hot pixels to generate bit streams. We subject the resultant bit streams to a battery of standard benchmark statistical tests for randomness and show that these bit streams are statistically the same as a perfect random bit stream. Strategies for improvi...

We present a new Cryptographically Secure Pseudo-Random Number Generator. It uses permutations as its internal state, similarly to the RC4 stream cipher. We describe a statistical test which revealed non-random patterns in a sample of 2 outputs of a 3-bit RC4. Our new algorithm produced 2 undistinguishable from random 3-bit outputs in the same test. We probed 2 outputs of the algorithm in diffe...

This work presents an autonomous mobile robot in order to cover an unknown terrain “randomly”, namely entirely, unpredictably and evenly. This aim is very important, especially in military missions, such as the surveillance of terrains, the terrain exploration for explosives and the patrolling for intrusion in military facilities. The “heart” of the proposed robot is a chaotic motion controller...

In this short paper we propose a pseudorandom number generator over EC based on Pollardlike method. In contrast to the well known Elliptic Curve Random Number Generator (see e.g. ANSI and NIST draft standards) the generator is based on a random walk over the group of EC-points like in the original Pollard’s rho algorithm and only resembles a little bit the linear congruential generator over ell...

Quantum-dot Cellular Automata (QCA) is a prominent paradigm that is considered to continue its dominance in thecomputation at deep sub-micron regime in nanotechnology. The QCA realizations of five-input Majority Voter based multilevel parity generator circuits have been introduced in recent years. However, no attention has been paid towards the QCA instantiation of the generic (n-bit) even and ...

Expanding the Length of a Pseudo-Random Number Generator We now want to show how a pseudo-random number generator that only does a little bit of expansion, can be used to construct a pseudo-random generator that does a lot of expansion. The idea is that we view G(s) as consisting of “stuff” that we can spit out, together with a new seed that we feed back into the generator, etc., a polynomial n...