Random Number Generator — Cryptographically Secure RNG with Web

How Random Numbers Works

Random(min, max) → uniform distribution over [min, max]

This calculator uses the Web Crypto API (crypto.getRandomValues) to generate cryptographically secure pseudo-random numbers. Unlike Math.random(), the Web Crypto API is designed for security-sensitive applications and provides uniformly distributed values with no predictable pattern.

min

Minimum Value — The lower bound of the random range. Inclusive — the result can equal this value.

max

Maximum Value — The upper bound of the random range. Inclusive for integers, exclusive for decimals. For example, range [1, 100] can produce 100 for integers but not for decimals.

n

Count — How many random numbers to generate in a single batch. Maximum is 1000 per batch.

How to Use

1. Set the minimum and maximum values for your range.
2. Choose how many random numbers to generate (up to 1000 per batch).
3. Select the number of decimal places (0 for integers, 1-5 for decimals).
4. Optionally enforce unique values (no duplicates) — useful for lottery numbers or sampling without replacement.
5. View sum, average, min, and max of the generated numbers for statistical insight.

Quick Reference

Common Uses

• •Tabletop RPG gaming — rolling virtual dice (D4, D6, D8, D10, D12, D20) for Dungeons & Dragons and other role-playing games when physical dice are not available.
• •Lottery and raffle number generation — picking truly random numbers for lottery tickets, giveaways, and prize draws with guaranteed uniqueness so no one gets duplicate entries.
• •Statistical sampling — selecting random data points from a larger dataset for analysis, A/B testing group assignment, or Monte Carlo simulations for risk modeling.
• •Randomized classroom activities — selecting random students for questions, picking random problem numbers for homework, or creating randomized test versions to prevent cheating.
• •Password and PIN generation — creating random numeric PINs, verification codes, and secure numerical identifiers that are cryptographically unpredictable.

Understanding the Result

Random number generation is fundamental to simulations, statistical sampling, cryptography, gaming, and decision-making. This calculator uses cryptographically secure random number generation via the Web Crypto API (crypto.getRandomValues), which is suitable for most applications including security-sensitive ones. Unlike Math.random(), which uses a pseudo-random number generator (PRNG) seeded with the current time, the Web Crypto API draws entropy from the operating system's secure random source, making it unpredictable and suitable for cryptographic purposes. For integer generation, the range is uniformly sampled using modulo reduction of a 32-bit random value. For decimal values, a 32-bit random integer is mapped to the [0, 1) interval and scaled to your range. Note that true randomness includes occasional "patterns" and repeats — seeing three consecutive 7s in a sequence of random digits is not unusual and does not indicate a bug. True randomness is clumpy, which often surprises people who expect random numbers to appear evenly distributed.

Worked Examples

Frequently Asked Questions

Is this better than Math.random()?

Yes. Math.random() uses a pseudo-random number generator (PRNG) that is not cryptographically secure — its output can be predicted if you know the internal state. The Web Crypto API uses a cryptographically secure PRNG (CSPRNG), which is suitable for security applications like password generation and encryption keys. For most statistical simulations, both work fine, but the CSPRNG provides additional unpredictability guarantees.

Can I generate truly random numbers?

No software algorithm can generate truly random numbers — they are all deterministic PRNGs seeded by entropy. The Web Crypto API uses entropy from the operating system (hardware interrupts, mouse movements, disk timing jitter, network packet arrival times) to seed its generator, making it practically unpredictable. For true randomness, you would need hardware based on quantum phenomena like radioactive decay or photon beam splitters.

Why might I get fewer numbers than requested with unique mode?

If the range is smaller than the requested count, the generator cannot produce enough distinct values. For example, generating 10 unique integers between 1 and 5 is mathematically impossible — there are only 5 distinct values available. The generator will produce as many as it can within the collision-avoidance limit (100 attempts per requested number). If you receive fewer numbers than expected with unique mode, increase your range or decrease the count.

What is the difference between pseudo-random and cryptographically secure random numbers?

Pseudo-random number generators (PRNGs) like Math.random() use deterministic algorithms (typically linear congruential generators or Mersenne Twister) that produce statistically random-looking sequences but are predictable if you know the algorithm's internal state. Cryptographically secure PRNGs (CSPRNGs) add two key properties: forward secrecy (knowing past outputs does not help predict future ones) and backward secrecy (knowing current state does not reveal past outputs). CSPRNGs are required for security applications like TLS/SSL session keys, password salts, and cryptographic nonces. For non-security applications like games or simulations, a standard PRNG is sufficient and often faster.

Why do I see repeating patterns in supposedly random numbers?

True randomness is "clumpy" — sequences like 7-7-7 or 1-2-3-4-5 occur naturally in random data more often than people expect. The human brain is pattern-seeking and perceives structure even in perfectly random sequences. This is called the clustering illusion. In fact, if you generated 100 random digits and saw NO repeats or apparent patterns, that would actually be suspicious — truly random sequences have about a 63% chance of containing at least one consecutive repeat within 100 trials. If your application truly needs to avoid any repeated values, use the "unique values only" option.

What practical applications use cryptographically secure random numbers?

CSPRNGs are used everywhere in computing: TLS/SSL encryption handshakes use random numbers for session keys, password managers generate random passwords, online casinos use them for fair card shuffling, scientific computing uses them for Monte Carlo simulations that must be reproducible but unbiased, video games use them for procedural content generation and loot box mechanics, and financial systems use them for audit sampling and fraud detection algorithms. This calculator is appropriate for all these use cases except those that require hardware-level randomness certification (e.g., government lottery draws which typically require physical ball machines or quantum RNG devices).

Pro Tips

• →For lottery or raffle numbers, always use unique mode — this guarantees no duplicate picks and matches how real lotteries work (balls are drawn without replacement).
• →For Monte Carlo simulations and statistical sampling, generate large batches (100-1000 numbers) in a single call to reduce overhead from repeated DOM updates.
• →When generating random decimals between 0 and 1 for probability simulations, use min=0, max=1, decimals=4 or 5 for sufficient precision without unnecessary decimal clutter.
• →If you need a random sample from a list of names or items, assign each item a number (1 to N), generate random unique numbers, and map the numbers back to the items. This works for jury selection, audit sampling, or randomized experiment group assignment.
• →For random passwords or PINs, generate a batch of integers and concatenate them — for example, 4 random digits from 0-9 produces a 4-digit PIN for ATM cards or phone unlock codes.
• →The Web Crypto API uses operating system entropy (hardware interrupts, mouse movements, disk timing jitter) to seed its generator. For applications that need the highest possible entropy, refresh the browser page to draw fresh entropy from the OS before generating numbers.

Limitations to Know

• •Not suitable for generating cryptographic keys directly — dedicated key generation libraries handle key stretching, encoding, and FIPS 140-2 compliance that this tool does not. Use this for non-cryptographic entropy needs.
• •The uniqueness constraint cannot be satisfied when the requested count exceeds the available range (e.g., 10 unique integers from 1 to 5 is mathematically impossible). The generator will produce as many as it can within the collision-avoidance limit.
• •Maximum batch size is capped at 1000 numbers to maintain responsive UI performance. For larger datasets, generate multiple batches or use a dedicated statistical software package.
• •Randomness quality depends on the browser's Web Crypto API implementation and the OS entropy pool. Older browsers or constrained environments (embedded systems, some mobile browsers) may have weaker entropy sources.
• •This is a software-based CSPRNG, not a hardware random number generator (HRNG). For applications requiring quantum-level randomness (e.g., lottery systems with regulatory compliance, cryptographic key generation for certificate authorities), use dedicated hardware RNG devices.

Sources

• NIST SP 800-90A - Random Number Generation
• Wikipedia - Random Number Generation
• MDN - Web Crypto API