Related papers: An optimization technique on pseudorandom generato…
Chaotic semiconductor lasers have been widely investigated for high-speed random bit generation, which is applied for the generation of cryptographic keys for classical and quantum cryptography systems. Here, we propose and demonstrate a…
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…
Dynamic and non-linear systems are emerging as potential candidates for random bit generation. In this context, chaotic systems, which are both dynamic and stochastic, are particularly suitable. This paper introduces a new continuous…
It is well-known that the quality of random number generators can often be improved by combining several generators, e.g. by summing or subtracting their results. In this paper we investigate the ratio of two random number generators as an…
The paper study counter-dependent pseudorandom generators; the latter are generators such that their state transition function (and output function) is being modified dynamically while working: For such a generator the recurrence sequence…
We present results of an extensive test program of a group of pseudorandom number generators which are commonly used in the applications of physics, in particular in Monte Carlo simulations. The generators include public domain programs,…
With meteoric developments in communication systems and data storage technologies, the need for secure data transmission is more crucial than ever. The level of security provided by any cryptosystem relies on the sensitivity of the private…
Chaotic systems, presenting complex and non-reproducible dynamics, may be found in nature from the interaction between planets to the evolution of the weather, but can also be tailored using current technologies for advanced signal…
Empirical tests for pseudorandom number generators based on the use of processes or physical models have been successfuly used and are considered as complementary to theoretical test of randomness. In this work a statistical methodology for…
To guarantee the integrity and security of data transmitted through the Internet, hash functions are fundamental tools. But recent researches have shown that security flaws exist in the most widely used hash functions. So a new way to…
A general method to produce uniformly distributed pseudorandom numbers with extended precision by combining two pseudorandom numbers with lower precision is proposed. In particular, this method can be used for pseudorandom number generation…
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…
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)…
Chaos enables the emergence of randomness in deterministic physical systems. Therefore it can be exploited for the conception of true random number generators (RNG) mandatory in classical cryptography applications. Meanwhile, nanomechanical…
The pseudo-random number generators (PRNGs), sampling algorithms, and algorithms for generating random integers in some common statistical packages and programming languages are unnecessarily inaccurate, by an amount that may matter for…
In this paper we present a new pseudorandom number generator (PRNG) on graphics processing units (GPU). This PRNG is based on the so-called chaotic iterations. It is firstly proven to be chaotic according to the Devaney's formulation. We…
Designing a pseudorandom number generator (PRNG) is a difficult and complex task. Many recent works have considered chaotic functions as the basis of built PRNGs: the quality of the output would indeed be an obvious consequence of some…
High quality random numbers are necessary in the modern world. Ranging from encryption keys in cyber security to models and simulations for scientific use: it's important that these random numbers are of high quality and quickly attainable.…
This paper presents an algorithm for generating pseudorandom numbers using quasigroups. Random numbers have several applications in the area of secure communication. The proposed algorithm uses a matrix of size n x n which is pre-generated…
Generating secure random numbers is vital to the security and privacy infrastructures we rely on today. Having a computer system generate a secure random number is not a trivial problem due to the deterministic nature of computer systems.…