Наука и инновации 3-jild vation-son (2025) · 129–135-betlar

UNDERSTANDING RANDOMNESS IN COMPUTING: TRUE AND PSEUDO-RANDOM NUMBER GENERATORS

Safoev, Nuriddin, Salimov, Sirojiddin, Yuldasheva, Nafisa, Murodov, Ma’mur, Fayziraxmonov, Boburjon

DOI: 10.5281/zenodo.15637067 · Manbada o'qish →

Annotatsiya

Random number generation is a critical building block in computer science, underpinning applications in cryptography, simulations, secure communications, and statistical modeling. This paper presents a comprehensive overview of both true random number generators (TRNGs) and pseudo-random number generators (PRNGs)—two fundamentally different approaches to generating randomness. TRNGs rely on inherently unpredictable physical processes, such as thermal noise, radioactive decay, or quantum phenomena, to produce non-deterministic output. In contrast, PRNGs employ algorithmic methods that, while deterministic and reproducible, aim to simulate randomness from an initial seed value.

Random number generation, pseudo-random number generation, entropy, cryptography, simulations.

Metadata manbasi: jurnal OAI-PMH arxivi · Sindex to'liq matnni saqlamaydi, manbaga havola beradi.