In this short note an alternative definition of the Bit-Search Generator (BSG) is provided. This leads to a discussion of both the security of the BSG and ways in which it might be modified to either improve its rate or increase its security.

PRO (Pseudorandom Oracle) is an important security of hash functions because it ensures that the hash function inherits all properties of a random oracle up to the PRO bound (e.g., security against length extension attack, collision resistant security, preimage resistant security and so on). In this paper, we propose new blockcipher-based double-length hash functions, which are PROs up to O(2) ...

This paper presents a method of systematic search for optimal multipliers for congruential random number generators. The word-size of computers is a limiting factor for development of random numbers. The generators for computers up to 32 bit wordsize are already investigated in detail by several authors. Some partial works are also carried out for moduli of 2 and higher sizes. Rapid advances in...

In this paper we study a hardware efficient implementation of a uniform random number generator based on Cellular Automata. This random number generator can be used to create Additive Gaussian White Noise and other noise sources in wireless application simulations. The algorithm used to generate random numbers can be realized using simple digital circuits and memory, and we implemented it on an...

The paper presents a chaos-based True Random Number Generator (TRNG) implemented in commercially available mixed-signal PSoC reconfigurable devices without any external components. Contrary to the traditionally used sources of randomness (eg various ”well-behaved” analog noise sources) it uses well-defined deterministic analog circuit that exhibits chaos. A new simple method of mapping the dete...

In this paper, the evaluation of random bit generators for security applications is discussed and the concept of stateless generator is introduced. It is shown how, for the proposed class of generators, the verification of a minimum entropy limit can be performed directly on the post-processed random numbers thus not requiring a good statistic quality for the noise source itself, provided that ...

Abstract—Despite the low cost and simple structure to generate pseudo random number, truly random number still has its own place in many security systems. We have proposed a truly random number generator with scalable parameters, different requirements focused on cost or performance can be satisfied with proper voltage and working frequency and the randomness has passed the test under NIST SP 8...

A small-sized photonic quantum random number generator, easy to be implemented in small electronic devices for secure data encryption and other applications, is highly demanding nowadays. Here, we propose a compact configuration with Silicon nanocrystals large area light emitting device (LED) coupled to a Silicon photomultiplier to generate random numbers. The random number generation methodolo...

The bit-search generator (BSG) was proposed in 2004 and can be seen as a variant of the shrinking and self-shrinking generators. It has the advantage that it works at rate 1/3 using only one LFSR and some selection logic. We present various attacks on the BSG based on the fact that the output sequence can be uniquely defined by the differential of the input sequence. By knowing only a small par...