This work proposes a one-dimensional chaotic map with simple structure and three parameters. The phase portraits, bifurcation diagrams, Lyapunov exponent diagrams are first plotted to study the dynamical behavior of map. It is seen that exhibits areas constant chaos respect all then applied problem pseudo-random bit generation using technique generate four bits per iteration. shown algorithm pa...

Many Random Number Generators (RNG) are available nowadays; they are divided in two categories, hardware RNG, that provide “true” random numbers, and algorithmic RNG, that generate pseudo random numbers (PRNG). Both types usually generate random numbers (Xn)n as independent uniform samples in a range 0, . . . 2 − 1, with b = 8, 16, 32 or b = 64. In applications, it is instead sometimes desirabl...

The randomized result was obtained by viewing random bit sequences as vertices of an expander graph and performing a random walk upon choosing a start vertex uniformly at random, and casting a majority vote. The error (probability of majority vote resulting in error) exponentially decreases with the length of the random walk. We also saw a stronger statement based on Chernoff bounds for random ...

This paper introduces an inverter-based true random number generator (I-TRNG). It uses a single CMOS inverter to amplify thermal noise multiple times. An adaptive calibration mechanism based on clock tuning provides robust operation across wide range of supply voltage 0.5∼1.1 V and temperature -40∼140°C. 8-bit Von-Neumann post-processing circuit (VN8W) is implemented for maximum raw entropy ext...

In this appendix, we examine the 64-bit integer output sequences of the SFMT19937 generator (or the double-precision floating-point numbers in [0, 1) converted from them). In fact, the SFMT generators are optimized under the assumption that one will mainly be using 32-bit output sequences, so that the dimensions of equidistribution with v-bit accuracy for 64-bit output sequences are worse than ...

We present a simple new construction of a pseudorandom bit generator, based on the constant depth generators of [N]. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (eg P, NC, PSPACE, ...) using an arbitrary function that is hard for C. This construction reveals an equivalence between the problem of proving lower b...

In this appendix, we examine the 64-bit integer output sequences of the SFMT19937 generator (or the double-precision floating-point numbers in [0, 1) converted from them). In fact, the SFMT generators are optimized under the assumption that one will mainly be using 32-bit output sequences, so that the dimensions of equidistribution with v-bit accuracy for 64-bit output sequences are worse than ...

RFID tags have severe constraints in computing power and hence offer particular challenges in the provision of e-Security. Whatever is chosen to provide security in an RFID tag should have low computational overhead. New approaches, differing from the traditional cryptosystems based on RSA, Diffie-Hellman, et al. are required. The use of one time codes is particularly appropriate as they guaran...