By Gael H Hofemeier,

Published:06/23/2011 Last Updated:06/23/2011

Previously refered to as "Bull Mountain", the RdRand instruction will present itself on the upcoming "Ivy Bridge" platform coming out early 2012. The RdRand instruction paves the way to fast, reliable entropy generated on the processor resulting in highly robust random numbers!

What is a Random Number Generator (RNG)? It is a utility or device that produces a sequence of numbers on an interval such that values appear unpredictable (hopefully!) Each value must be statistically independent of the previous value, the overall distribution of number chosen from the interval are uniformly distributed and the sequence is unpredictable. Additionally, we would like the RNG to be fast in returning a value and it should be highly scalable (it should produce a large number of requests within a short time interval.) It should also be secure against attackers who might observe or change its underlying state in order to predict or influence its output or interfere with its operation.

With respect to the taxonomy of Random Number Generators, here are a few of the different types:

uses a deterministic algorithm, typically implemented in software, computes a sequence of numbers that "look" random. They require a seed and the same PRNG will always produce the exact same sequence of "random" numbers. Not really so random, right? PRNGs are largely considered to be cryptographically insecure - this is a problem that researchers have worked on to solve by creating "Cryptographically Secure PRNGS" (CSPRNGS).**Pseudo-Random Number Generators (PRNGs):**

Does not use a mathematical model to deterministically generate numbers that "look" random. Rather, TRNGs extract "randomness" (entropy) from a physical source of some type and then uses that to generate random numbers. The physical source of entropy might be key strokes or mouse movements, for example. The key challenge for TRNG designers is to find a reliable source for entropy as the resulting value sequences generally fail to meet desired statistical properties with rigor. It's good that TRNGs use non-deterministic methods; however they have other shortfalls.**True Random Number Generators (TRNGs):**

Used in modern operating systems such as Linux and cryptographic libraries, takes input from an entropy source in order to supply a buffer or pool of entropy. The entropy pool is then used to provide nondeterministic random numbers that periodically seed a cryptographically secure PRNG (CSPRNG). This CSPRNG provides cryptographically secure random numbers that appear truly random and exhibit a well-defined level of computational attack resistance. One key advantage here is performance. Sampling entropy sources can be slow since it often involves device IO of some type and some time for a real-time sampling event to occur. CSPRNGs are fast since they are processor-based and avoid IO and entropy source delays.**Cascade Construction RNGs:**

**Finally, what IS Bull Mountain, the technology??**

Mostly, Bull Mountain follows the Cascade Construction RNG model, using a processor resident entropy source to repeatedly seed a hardware-implemented CSPRNG. Unlike software approaches, it includes a high-quality entropy source implementation which can be sampled quickly to repeatedly seed the CSPRNG with high quality entropy. It represents a self-contained hardware module that is isolated from software attacks on its internal state resulting in a solution that achieves Random Number Generation objectives with considerable robustness: Statistical quality, highly unpredictable random number sequences, high performance, protection against attacks.

The Digital Random Number Generator (DRNG) is unique in its approach in that it is implemented in hardware on the processor chip itself and is available to software running at all privilege levels (even to VMs!!)

Bull Mountain also leverages a variety of cryptographic standards to ensure the robustness of its implementation and to provide transparency in its manner of operation. These include NIST SP800-90, FIPS-140-2, and ANSI X9.82.

**About the RdRand instruction:**

- Retrieves a hardware generated random value from the DRNG and stores it in the destination register given as an argument to the instruction. The size of the random value (16-,32-, or 64-bits) is determined by the size of the register given.

- The Carry Flag (CF) must be checked to determine whether a random value was available at the time of the instruction execution.

- There are no hardware ring requirements.

- Determine programmatically whether a given Intel platform supports RdRand, use the CPUID instruction to examine bit 30 of the ECX register. A value of 1 indicates that the processor supports the RdRand instruction.

- For code examples, refer to the Bull Mountain Implementation Guide. The Implementation guide has many coding examples on how you would "roll your own" implementation, should you wish to. Eventually you should be able to implement it via a function call from your favorite Cryptographic Library.

The Bull Mountain Software Implementation Guide was recently made available on the Manageability and Security Community. Oddly enough, however, this is not the first time we have revealed what it is and how to implement it. It has been documented in the Intel® AVX web page under section 8.6 for quite a long time and it is also referenced in the Intel® 64 and IA-32 Architectures Software Developer’s Manual. Don't have hardware yet to test your implementation? Don't worry, there is a Software Developer Emulator that supports the RdRand instruction out there on our "Whatif" website. Note, that through emulation, you will NOT be able to test actual results and performance - that must be done on actual hardware.

Performance varies by use, configuration and other factors. Learn more at www.Intel.com/PerformanceIndex.