0110011010101010101010010101

ISSN: 2278 – 1323 All Rights Reserved © 2014 IJARCET 3504  Abstract— True random bit generator requires a naturally occurring source of randomness. Designing a hardware device or software program to exploit this randomness and produce a bit sequence that is free of biases and correlation is difficult task. For most cryptographic applications, the generator must not be subject to observation or...

Random Number Generators (RNGs) are an important building block for algorithms and protocols in cryptography. Random number generation is used in a wide variety of cryptographic operations, such as key generation and challenge/response protocols. A random number generator outputs a sequence of 0s and 1s such that at any position, the next bit cannot be expected on the previous bits. However, tr...

Critical cryptography applications require the production of an unpredictable and unbiased stream of binary data derived from a fundamental noise mechanism, which is quite difficult to create with a stable random bit stream, as required for statistical randomness, when using a random generator with only a hardware component. However, since all electronic systems are influenced by a finite bandw...

Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pseudo-random bit generator. This new generator outputs n− c− 1 bits per exponentiation with a c-bit exponent. Using typical parameters, n = 1024 and c = 160, this yields roughly 860 pseudo-random bits per small exponent...

We present a pseudo-random bit generator expanding a uniformly random bitstring r of length k/2, where k is the security parameter, into a pseudo-random bit-string of length 2k − log(k) using one modular exponentiation. In contrast to all previous high expansion-rate pseudo-random bit generators, no hashing is necessary. The security of the generator is proved relative to Paillier’s composite d...

In this article, it is shown how 128-bit SSE2 multimedia extension registers, present in Pentium IV class 32-bit processors, may be used to generate random numbers at several times greater speed then when regular general purpose registers are used. In particular, a 128-bit algorithm is presented for the Marsaglia MWC1616 generator from the DIEHARD battery of random number generator tests, and i...