CSPRNG Cryptographic Random Number Generator

Generating an integer in the range $[\text{Min}, \text{Max}]$ using Math.floor(Math.random() * (Max - Min + 1)) suffers from two distinct problems in security-sensitive contexts:

1. 1Deterministic PRNG Engine: Standard JavaScript Math.random() can be predicted if an attacker observes sufficient consecutive outputs.
2. 2Modulo Truncation Bias: When mapping a 32-bit unsigned integer ($0$ to $2^{32}-1$) into a custom range where the range size does not divide $2^{32}$ evenly, lower numbers receive an infinitesimal probability advantage.

Our generator implements rejection sampling across a 32-bit unsigned integer array (Uint32Array). Any random number falling above the largest integer multiple of the range interval is discarded and re-drawn, guaranteeing perfect statistical uniformity across all numbers.

• One-Time Passcodes (OTP): Generating 6-digit SMS or authenticator PINs ($100000$ to $999999$).
• Cryptographic Nonces: Generating random initialization counters for encryption algorithms (AES-GCM).
• Lottery & Raffle Draws: Generating provably fair, non-repeating integer selections for contests.