Quantum Random Number Generator

Posted on July 18, 2007  Comments (1)

Quantum Random Bit Generator Service:

The work on QRBG Service has been motivated by scientific necessity (primarily of local scientific community) of running various simulations (in cluster/Grid environments), whose results are often greatly affected by quality (distribution, nondeterminism, entropy, etc.) of used random numbers. Since true random numbers are impossible to generate with a finite state machine (such as today’s computers), scientists are forced to either use specialized expensive hardware number generators, or, more frequently, to content themselves with suboptimal solutions (like pseudo-random numbers generators).

To achieve high availability of the service, several network access modes are developed, or shall be developed. These include transparent acquisition of random numbers using C/C++ libraries, web services (access over the SOAP protocol), and Mathematica/MATLAB client add-ons.
To enable high security, in future, SSL protocol shall be supported, i.e. all data shall be encrypted, at users request, with user/service certificates.
We use ‘Quantum Random Bit Generator’ (QRBG121), which is a fast non-deterministic random bit (number) generator whose randomness relies on intrinsic randomness of the quantum physical process of photonic emission in semiconductors and subsequent detection by photoelectric effect. In this process photons are detected at random, one by one independently of each other. Timing information of detected photons is used to generate random binary digits – bits.

One Response to “Quantum Random Number Generator”

  1. xm carreira
    July 19th, 2007 @ 7:03 am

    A good linear congruential algorithm of random numbers like this

    X(n+1) = (a*X(n) + b) mod (p)

    is fast and accurate enough for most of the engineering simulations but it is easy to guess, so it is not valid for encripting.

Leave a Reply