/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 marc-b-reynolds.github.io
prns.h
| | preshing.com
How to Generate a Sequence of Unique Random Integers
3.1 parsecs away

Travel
| | Suppose we wish to generate a sequence of 10000000 random 32-bit integers with no repeats. How can we do it? 422253117, 3056114362, 1677071617, 478652086, 2970049140, ... I faced ...
| | www.johndcook.com
A cryptographically secure random number generator CSPRNG
5.9 parsecs away

Travel
| | Example of a cryptographically secure random number generator with Python sample code
| | blog.gistre.epita.fr
Random number generation in embedded systems - The Gistre Blog
4.4 parsecs away

Travel
| | This article explores the world of random number generation in embedded systems, covering both pseudo-random number generators (PRNGs) and hardware-based random number generators (HRNGs). It explains their principles, provides examples of code, discusses their advantages and limitations, and highlights their applications in embedded systems.
| | www.thomas-huehn.com
Myths about /dev/urandom
33.1 parsecs away

Travel
| [AI summary] The article discusses the use of /dev/random and /dev/urandom in Linux systems for generating random numbers. It highlights that /dev/urandom is generally preferred over /dev/random due to its non-blocking nature and sufficient cryptographic security. The article also addresses misconceptions in the man pages and emphasizes that /dev/urandom is safe for most applications, including cryptographic uses, as long as the initial seeding is done properly. It mentions that while /dev/random is considered a legacy interface, it's not always necessary, and modern Linux distributions and syscalls like getrandom(2) provide better alternatives.