Concept

Pseudorandom number generator

A pseudorandom number generator (PRNG), also known as a deterministic random bit generator (DRBG), is an algorithm for generating a sequence of numbers whose properties approximate the properties of sequences of random numbers. The PRNG-generated sequence is not truly random, because it is completely determined by an initial value, called the PRNG's seed (which may include truly random values). Although sequences that are closer to truly random can be generated using hardware random number generators, pseudorandom number generators are important in practice for their speed in number generation and their reproducibility. PRNGs are central in applications such as simulations (e.g. for the Monte Carlo method), electronic games (e.g. for procedural generation), and cryptography. Cryptographic applications require the output not to be predictable from earlier outputs, and more elaborate algorithms, which do not inherit the linearity of simpler PRNGs, are needed. Good statistical properties are a central requirement for the output of a PRNG. In general, careful mathematical analysis is required to have any confidence that a PRNG generates numbers that are sufficiently close to random to suit the intended use. John von Neumann cautioned about the misinterpretation of a PRNG as a truly random generator, joking that "Anyone who considers arithmetical methods of producing random digits is, of course, in a state of sin." In practice, the output from many common PRNGs exhibit artifacts that cause them to fail statistical pattern-detection tests. These include: Shorter-than-expected periods for some seed states (such seed states may be called "weak" in this context); Lack of uniformity of distribution for large quantities of generated numbers; Correlation of successive values; Poor dimensional distribution of the output sequence; Distances between where certain values occur are distributed differently from those in a random sequence distribution. Defects exhibited by flawed PRNGs range from unnoticeable (and unknown) to very obvious.

Official source

https://en.wikipedia.org/wiki/Pseudorandom_number_generator

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related courses (32)

EE-548: Audio engineering

This lecture is oriented towards the study of audio engineering, room acoustics, sound propagation, and sound radiation from sources and acoustic antennas. The learning outcomes will be the techniques for microphones and loudspeaker design, as well as room ...

COM-301: Computer security and privacy

This is an introductory course to computer security and privacy. Its goal is to provide students with means to reason about security and privacy problems, and provide them with tools to confront them. ...

MATH-467: Probabilistic methods in combinatorics

The 'probabilistic method' is a fundamental tool in combinatorics. The basic idea is as follows: to prove that an object (for example, graph) with certain properties exists, it suffices to prove that if the object is chosen at random, then it has the desir ...

Related lectures (32)

Semantic Security: Stream Ciphers

Explores semantic security in stream ciphers, emphasizing pseudorandom number generators and computational limitations in cryptography.

Commitment Scheme: Key Derivation and Hash Function

Explains the commitment scheme, key derivation, and hash function for data security.

Interactive Number Guessing Game

Covers the development of an interactive number guessing game in MATLAB, demonstrating variable initialization, random number generation, and interactive user input.

Related units (3)

Security and Cryptography Laboratory

SCI STI LT Group

Programming Methods Laboratory 1

Related exercises (1)

Mass hanging on a circuit

A mass m, subject to gravity, is hanging on a rectangular circuit in which circulates a current I. The superior part of the circuit is located inside of an uniform magnetic field B₀ perpendicular to the plane of the figure. Determine B₀ such that the mass freely floats. When we increase the current, we notice that the circuit and the mass are moving upwards. What is the work realised by the magnetic field when the mass goes upwars with Δzu2004=u2004h? The field applies on the horizontal side a force ${\bf

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Official source

https://en.wikipedia.org/wiki/Pseudorandom_number_generator

About this result

Related courses (32)

EE-548: Audio engineering

COM-301: Computer security and privacy

MATH-467: Probabilistic methods in combinatorics

Related lectures (32)

Semantic Security: Stream Ciphers

Explores semantic security in stream ciphers, emphasizing pseudorandom number generators and computational limitations in cryptography.

Commitment Scheme: Key Derivation and Hash Function

Explains the commitment scheme, key derivation, and hash function for data security.

Interactive Number Guessing Game

Covers the development of an interactive number guessing game in MATLAB, demonstrating variable initialization, random number generation, and interactive user input.

Related publications (7)

Optimal origin selection for minimal multipolar modeling of bianisotropic metasurfaces

We develop a modeling framework based on multipolar decomposition that fully captures a metasurface electromagnetic response while using the minimum number of multipole moments, since excessive multipoles make modeling complex and computationally ineffective. One of the most important characteristics that determines the required number of multipole moments is the choice of the origin of the system of coordinates used for the multipolar decomposition. Here, we split multipolar contributions into even and odd

SPIE Europe2026

All Polynomial Generators Preserve Distance with Mutual Correlated Agreement

A generator is a function that maps a random seed to a list of coefficients. We study generators that preserve distance to a linear code: the linear combination of any list of vectors using coefficients sampled by the generator has distance to the code no smaller than that of the original vectors, except for a small error. Distance preservation plays a central role in modern probabilistic proofs, and has been formalized in several ways. We study mutual correlated agreement, the strongest known form of dista

Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing2026

On the Required Number of Records for the Estimation of the “True” Mean Seismic Demand of Masonry Building Typologies

In recent years, probabilistic methods have become the main tool for the seismic assessment of built heritage structures. Nonetheless, probabilistic methods based on non-linear time history analyses face the challenge of a limited selection of recorded ground motions. This study statistically examines the minimum number of records that are necessary to provide a reasonable estimation of the “true” mean seismic demand for the case of masonry buildings. First, structural models are developed based on represen

Springer Science and Business Media B.V.2026

Related people (23)

Michaël Unser

Expertise Image Processing, Medical Imaging, Biological Imaging, Wavelets, Splines, Multiresolution Michael Unser is Full Professor with EPFL’s school of Engineering and the academic director of EPFL's Center for Imaging, Lausanne, Switzerland. His primary areas of investigation are signal processing, biomedical imaging and applied functional analysis. He is internationally recognized for his research contributions to sampling theory, wavelets, the use of splines for image processing, stochastic processes,

Edoardo Charbon

Edoardo Charbon (SM’00 F’17) received the Elektrotechnik Diploma from ETH Zurich, the M.S. from the University of California at San Diego, and the Ph.D. from the University of California at Berkeley in 1988, 1991, and 1995, respectively, all in electrical engineering and EECS. He has consulted with numerous organizations, including Bosch, X-Fab, Texas Instruments, Maxim, Sony, Agilent, and the Carlyle Group. He was with Cadence Design Systems from 1995 to 2000, where he was the architect of the company's initiative on information hiding for intellectual property protection. In 2000, he joined Canesta Inc., as the Chief Architect, where he led the development of wireless 3-D CMOS image sensors. Since 2002 he has been a member of the faculty of EPFL, where is a full professor since 2015. From 2008 to 2016 he was full professor and chair at the Delft University of Technology, where he spearheaded the university's effort on cryogenic electronics for quantum computing as part of QuTech. He has been the driving force behind the creation of deep-submicron CMOS SPAD technology, which is mass-produced since 2015 and is present in smartphones, telemeters, proximity sensors, and medical diagnostics tools. His interests span from 3-D vision, LiDAR, FLIM, FCS, NIROT to super-resolution microscopy, time-resolved Raman spectroscopy, and cryo-CMOS circuits and systems for quantum computing. He has authored or co-authored over 400 papers and two books, and he holds 23 patents. Dr. Charbon is a distinguished visiting scholar of the W. M. Keck Institute for Space at Caltech, a fellow of the Kavli Institute of Nanoscience Delft, a distinguished lecturer of the IEEE Photonics Society, and a fellow of the IEEE.

Yanina Yurina Shkel

Teaching & PhD PhD Students Serhat Emre Coban, Anuj Kumar Yadav, Cemre Çadir Courses Advanced probability and applications COM-417 In this course, various aspects of probability theory are considered. The first part covers the main theorems in the field (law of large numbers, central limit theorem), while the second part focuses on the theory of martingales and concentration inequalities. Signal processing COM-202 Signal processing theory and applications: discrete and cont

Arash Amini

Mario Paolone

Mario Paolone received the M.Sc. (with honors) and the Ph.D. degree in electrical engineering from the University of Bologna, Italy, in 1998 and 2002, respectively. In 2005, he was appointed assistant professor in power systems at the University of Bologna where he was with the Power Systems laboratory until 2011. In 2010, he received the Associate Professor eligibility from the Politecnico di Milano, Italy. Since 2011 he joined the Swiss Federal Institute of Technology, Lausanne, Switzerland, where he is now Full Professor, Chair of the Distributed Electrical Systems laboratory and Head of the Swiss Competence Center for Energy Research (SCCER) FURIES (Future Swiss Electrical infrastructure). He was co-chairperson of the technical programme committees of the 9th edition of the International Conference of Power Systems Transients (IPST 2009) and of the 2016 Power Systems Computation Conference (PSCC 2016). He was chair of the technical programme committee of the 2018 Power Systems Computation Conference (PSCC 2018). In 2013, he was the recipient of the IEEE EMC Society Technical Achievement Award. He was co-author of several papers that received the following awards: best IEEE Transactions on EMC paper award for the year 2017, in 2014 best paper award at the 13th International Conference on Probabilistic Methods Applied to Power Systems, Durham, UK, in 2013 Basil Papadias best paper award at the 2013 IEEE PowerTech, Grenoble, France, in 2008 best paper award at the International Universities Power Engineering Conference (UPEC). He was the founder Editor-in-Chief of the Elsevier journal Sustainable Energy, Grids and Networks and was Associate Editor of the IEEE Transactions on Industrial Informatics. His research interests are in power systems with particular reference to real-time monitoring and operation, power system protections, power systems dynamics and power system transients. Mario Paolone is author or coauthor of over 300 scientific papers published in reviewed journals and international conferences.

Mika Tapani Göös

Website https://theory.epfl.ch/mika/ Teaching & PhD PhD Students Valentin Imbach, Ziyi Guan, Artur Riazanov, Anastasiia Sofronova, Weiqiang Yuan Past EPFL PhD Students Maystre Gilbert Théodore Courses Computational complexity CS-524 In computational complexity we study the computational resources needed to solve problems and understand the relation between different types of computation. This course advances the students knowledge of computational complexity, and develop an understanding o

Ziyi Guan

Weiqiang Yuan

Ivan Michel Antolovic

Claudio Bruschini

Claudio Bruschini holds an MSc in high energy physics from the University of Genova and a PhD in Applied Sciences from the Vrije Universiteit Brussel (VUB). He started his career with INFN (Italy, 1993), in the WA92 CERN collaboration (particle physics), and then moved to CERN as a Fellow in the European GP-MIMD2 project, attached to the NA48 collaboration (particle physics, parallel programming, 1994-1995). He then started his close collaboration with EPFL, first in the DeTeC (Demining Technology Center) project (sensors for landmine detection/humanitarian demining, 1996-1997). After DeTeC's end, he started the first of a series of fruitful collaborations with the Vrije Universiteit Brussel (VUB) on humanitarian demining related R&D (1998). This was followed by the EUDEM survey project (The European Union in Humanitarian Demining, 1998), the EUDEM2 three year EC sponsored support measure (www.eudem.info, 2001-2004), and the DELVE support action (www.delve.vub.ac.be, 2007). In parallel he started working within the EPFL's AQUA group (Advanced Quantum Architectures, Edoardo Charbon), on topics as diverse as ultrasonic sensors for in-air application, optical 3D and high speed 2D sensing, sensor networks, or tracking/motion capture systems, in particular for the preparation of research projects. This culminated in the European MEGAFRAME (www.megaframe.eu, FP6, 2006-2010, SPAD arrays and related in-pixel time stamping electronics in deep submicron CMOS technology) and SPADnet (www.spadnet.eu, FP7, 2010-2014, networked SPAD arrays for Positron Emission Tomography) projects, coordinated by EPFL-AQUA. As from 2009 he also worked with Dario Floreano on the management of the CURVACE Curved Artificial Compound Eyes FP7 project (www.curvace.org), coordinated by EPFL-LIS. He was also active with CHUV (Lausanne University Hospital) within EndoTOFPET-US (endoscopic PET) as well as on a CTI project devoted to the development of a new hand-held standalone tool for tracer-guided medical procedures. In 2014 he had also the pleasure of joining the EPFL ICLAB of Christian Enz during its ramp-up phase, collaborating on device related topics (SNF GigaRadMOST) and biomedical R&D (NanoTera WiseSkin). Claudio is now fully with EPFL’s Advanced Quantum Architecture (AQUA). He has also been active as independent scientific consultant, under the label CBR Scientific Consulting, on the preparation of (European) R&D project proposals and the execution of individual studies, and worked in 2006 for a local start-up as operations manager and R&D advisor.... but this is another story. An unauthorized early biography is available at http://lami.epfl.ch/team/claudiob/...

Related units (3)

Security and Cryptography Laboratory

SCI STI LT Group

Programming Methods Laboratory 1

Related concepts (28)

Cryptographically secure pseudorandom number generator

A cryptographically secure pseudorandom number generator (CSPRNG) or cryptographic pseudorandom number generator (CPRNG) is a pseudorandom number generator (PRNG) with properties that make it suitable for use in cryptography. It is also loosely known as a cryptographic random number generator (CRNG). Most cryptographic applications require random numbers, for example: key generation nonces salts in certain signature schemes, including ECDSA, RSASSA-PSS The "quality" of the randomness required for these applications varies.

Cryptography

Cryptography, or cryptology (from κρυπτός "hidden, secret"; and γράφειν graphein, "to write", or -λογία -logia, "study", respectively), is the practice and study of techniques for secure communication in the presence of adversarial behavior. More generally, cryptography is about constructing and analyzing protocols that prevent third parties or the public from reading private messages. Modern cryptography exists at the intersection of the disciplines of mathematics, computer science, information security, electrical engineering, digital signal processing, physics, and others.

Pseudorandomness

A pseudorandom sequence of numbers is one that appears to be statistically random, despite having been produced by a completely deterministic and repeatable process. Simply put, the problem is that many of the sources of randomness available to humans (such as rolling dice) rely on physical processes not readily available to computer programs. The generation of random numbers has many uses, such as for random sampling, Monte Carlo methods, board games, or gambling.

Related exercises (1)

Mass hanging on a circuit

Related notebooks (2)

Classical Monte Carlo Simulations of the Ising Model on Square Lattice

"## Classical Monte-Carlo simulations of the Ising model on square lattice\n", "\n", "The Ising model considers the following Hamiltonian\n", "\n", "

\\hat{\\mathcal{H}} = -J\\displaystyle\\sum_{}\\sigma_i \\sigma_j

,\n", "\n", "in which spins

\\sigma_i

can take only two discrete values

\\sigma_i \\in \\{-1,+1\\}

. Below, we will consider spins on two-dimensional square lattice taking into account couplings

J

only for the nearest neighbor sites. For

J > 0

the ferromagneti

Modeling Epidemics with Signal Processing Techniques

Epidemics and Signal Processing[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

In [1]: import matplotlib.pyplot as plt import numpy as np import scipy.signal as sp import seaborn as sns sns.set() In [2]: plt.rcParams["figure.figsize"] = (14,4) The basic reproduction number[4]¶ The propagation mechanism of an epidemic such as the one caused by SARS-CoV-2 virus can be roughly modeled, at least in its inital phase, as a process in which each infected individ