The venerable Linux /dev/random served users of cryptographic mechanisms well for a long time. Its behavior is well understood to deliver entropic data. In the last years, however, the Linux /dev/random showed signs of age where it has challenges to cope with modern computing environments ranging from tiny embedded systems, over new hardware resources such as SSDs, up to massive parallel system...

We present results of extensive statistical and bit level tests on three implementations of a pseudorandom number generator algorithm using the lagged Fibonacci method with an occasional addition of an extra bit. First implementation is the RCARRY generator of James, which uses subtraction. The second is a modified version of it, where a suggested error present in the original implementation ha...

The main aim of this chapter is to provide a security evaluation method based on fuzzy logic “for a pseudo-random sequences used (mainly) in stream cipher systems. The designed Fuzzy rules consider two main parameters, which are the length of the maximum period of the key sequence obtained from Linear Feedback Shift Register (LFSR) and the entropy of the result in sequences obtained from differ...

The register file is a key datapath component of a superscalar microprocessor. Its access time is critical since it can impact cycle time. Its size can easily become a problem: superscalar microprocessors have a large number of ports (typically 10 for a three-scalar machine) and the size is quadratic in the number of ports. The “3-D Register File’” uses the area inherently consumed by the metal...

This paper presents a performance and statistical analysis of random number generators and discrete Gaussian samplers implemented in software. Most Lattice-based cryptographic schemes utilise discrete Gaussian sampling and will require a quality random source. We examine a range of candidates for this purpose, including NIST DRBGs, stream ciphers and well-known PRNGs. The performance of these r...

We present a new Design for the generation of Advanced encryption of (bit) data. The Design opted to obtain this encrypted data is RM-PRNG. This design also enhances the statistical properties of a chaos-based logistic map pseudo random number generator (PRNG) and extends the system period length. The reseeding method removes the short periods of the digitized logistic map and the mixing method...

Cryan and Miltersen [8] recently considered the question of whether there can be a pseudorandom generator in NC, that is, a pseudorandom generator that maps n-bit strings to m-bit strings such that every bit of the output depends on a constant number k of bits of the seed. They show that for k = 3, if m ≥ 4n + 1, there is a distinguisher; in fact, they show that in this case it is possible to b...

Fnou srupty BErNG A MATHEMATIcAL cuRroslry fifteen years ago, binary sequence generating shift registers have become important tools in a surprising range of applications. The random-like patterns of 1's and 0's generated by these circuits are used to obtain increased range in radars,' to encode and decode digital and analog data for secure storage and transmission,2 to encode and decode digita...

This paper presents a new True Random Number Generator (TRNG) based on an analog Phase-Locked Loop (PLL) implemented in a digital Altera Field Programmable Logic Device (FPLD). Starting with an analysis of the one available on chip source of randomness the PLL synthesized low jitter clock signal, a new simple and reliable method of true randomness extraction is proposed. Basic assumptions about...

We experimentally realize a robust real-time random number generator by differentially comparing the signal from a chaotic semiconductor laser and its delayed signal through a 1-bit analog-to-digital converter. The probability density distribution of the output chaotic signal based on the differential comparison method possesses an extremely small coefficient of Pearson's median skewness (1.5 ×...