Introduction Random numbers play a large and significant role in several fields and applications from cryptography to gaming to gambling. As a result, random number generators (RNGs) occupy a similarly important role. By their very nature, however, random numbers are difficult to fabricate, especially in the large quantities that they are often needed. In this paper I will discuss various topic...

Fast and reliable pseudo-random number generators are required for simulation and other applications in Scientific Computing. We outline the requirements for good uniform random number generators, and describe a class of generators having very fast vector/parallel implementations with excellent statistical properties. We also discuss the problem of initialising random number generators, and con...

Microsoft attempted to implement theWichmann–Hill RNG in Excel 2003 and failed; it did not just produce numbers between zero andunity, itwould also produce negative numbers. Microsoft issued a patch that allegedly fixed the problem so that the patched Excel 2003 and Excel 2007 now implement the Wichmann–Hill RNG, as least according to Microsoft. We show thatwhatever RNG it is thatMicrosoft has ...

Randomness is of fundamental importance in various fields, such as cryptography, numerical simulations, or the gaming industry. Quantum physics, which is fundamentally probabilistic, is the best option for a physical random number generator. In this article, we will present the work carried out in various projects in the context of the development of a commercial and certified high speed random...

The meta-analysis of Intangible Brain-Machine Interaction (IMMI) data with random number generators (RNG’s) (Bösch, 2006) is re-evaluated through the application of rigorous and recognised mathematical tools. The current analysis shows that the statistical average of the true RNG-IMMI data is not shifted from chance by direct mental intervention, thus refuting the IMMI hypothesis. A facet of th...

In this letter, we present a circuit implementation for the discrete-time zigzag map, which exhibits high speed, low power consumption, and above all resilience to process variations. Circuit parameter variations result in alteration of the chaotic map parameters, such as the slope and the location of the breakpoints in the map, which in turn degrade the randomness of the generated bit sequence...

In this talk I will provide a description of recent uses Intel has made of cryptography in our platforms, including providing a hardware random number generator, using anonymous signatures, and improving performance of cryptographic algorithms. I will discuss how processor capabilities could be used more effectively by cryptographic algorithms. I will then discuss research questions in cryptogr...

To guarantee the security of uniform random numbers generated by a quantum random number generator, we study secure extraction of uniform random numbers when the environment of a given quantum state is controlled by the third party, the eavesdropper. Here we restrict our operations to incoherent strategies that are composed of the measurement on the computational basis and incoherent operations...