QuickStudy: Random Numbers
We think of random numbers as being somehow arbitrary and unknowable in advance. Mathematically, a given string of numbers is random if there is no shorter way to express the string than the string itself. Thus, any sequence of numbers produced by a calculation or a formula can't be truly random.
Another way to think of this is that a string is random if you can't compress it. This definition excludes pi (3.14 . . . ) because a computer can reproduce a few billion digits of pi by applying a very short formula: a circle's circumference divided by its diameter. Thus, you can compress a billion digits into a short, simple formula: C/d. Unfortunately, just because you can't find a program that can compress a given sequence doesn't mean that there isn't one that someone may discover next month.
Intuitively, we equate randomness with a lack of discernible patterns, but even this isn't enough, because random processes will sometimes produce short sequences that appear to be nonrandom.
We care about random numbers because they are very useful in statistical applications, in testing procedures and software, and most especially in cryptography.
The only truly unbeatable cryptographic system uses what's called a one-time pad: a string of random numbers or letters used as a key to encode a message through some kind of transformation. If the pad is used only once and is truly random, it can never be broken. Use the same pad twice, however, and it's no longer unbreakable - at least in theory.
How to Make a Random Number
During World War II, British code clerks created random numbers for one-time pads using a method akin to that used for drawing numbers for a bingo game or lottery today - by drawing them out of a hat or a machine that scrambles their order.
That method worked but was slow and labor-intensive. Today, we use software programs called pseudorandom number generators that take an input value and perform a series of transformations and procedures. The input value must be truly random and is normally based on some unpredictable real-world event.
Several physical processes can be used to create random numbers. One method uses radioactive decay, which current physical theory assumes to be random. HotBits, an Internet resource, generates random numbers by timing successive particle pairs in radioactive decay detected by a Geiger-Muller tube.
Since 1999, Intel Corp. has supplied a hardware-based random number generator for use with its 8xx series of CPU support chip sets. Implemented in the Intel 82802 Firmware Hub Device, the generator uses thermal noise from a resistor to produce a random, nondeterministic and nonrepeating stream of bits.
secret key
Additional Resources



White Papers & Webcasts
Share our Strength
Download Now
Lower the Cost and Complexity of a Mobile Workforce through Automation
Download This Resource Now!
Top 10 Things to Know about Data Protection
Download Now
Managing Mobility: Improve Data Security, Compliance and Manageability
Download This Resource Now!
Managing Secure File Transfer to Save Time, Money and IT Resources
Learn how companies are using innovative technology to overcome these challenges and improve user productivity by offloading e-mail attachments and replacing FTP with...
Ponemon Study: The Business Risk of a Lost Laptop
Download Now
Security Convergence Equals Network Security Cost Savings
Listen to IBM Internet Security Systems' take on network security convergence.
Airport Insecurity: The Case of Lost Laptops
Download Now
Disaster Recovery 2008: Reduced Costs and Improved Performance
How long can your Enterprise afford to be without your data? With an accelerated disaster recovery program, you never have to answer this...
