Random Number Generation and Entropy Questions

Candidates should demonstrate a deep understanding of randomness requirements for cryptography including differences between true random number generation and pseudo random number generation, sources of entropy, seeding strategies, and entropy estimation. Topics include secure key and nonce generation, avoiding nonce reuse, entropy harvesting and replenishment policies, hardware entropy sources and their constraints, re seeding strategies, and methods to validate and monitor randomness in production. Candidates should also be able to discuss common pitfalls such as predictable seeds, deterministic fallbacks, or insufficient entropy on constrained devices and how to mitigate them.