After exploring the Gauss law in randomness, let's jump right into the fascinating process of

generating random numbers. At the heart of this exploration is the difference between pseudo-
random numbers and truly random numbers. Truly random numbers are often based on
unpredictable physical phenomena, like radioactive decay, providing a randomness that deterministic
pseudo-random numbers cannot match. Creating pseudo-random numbers, a key part of this
process, begins with something called a seed, where we add a transformation function. This method
permits to create pseudo random numbers by these factors.

To simplify, let's take a real example: imagine creating 500 random points in a 1x1 area. This
demonstrates how a sequence of pseudo-randomly generated numbers can model random events in
the real world.

As we continue exploring randomness, let's talk about the Monte Carlo method. For example, it can
help us figure out the value of π, showing how simulated unpredictability can solve complex
problems.

However, computer security reminds us that not everything is as random as it seems. Creating keys
for symmetric encryption methods is a good example. Even though having a perfectly random key
makes it very hard to guess, there are weaknesses. An American computer expert predicted lottery
results 14 times by understanding the seed and function used for generating pseudo-random
numbers.

To overcome this weakness, some encryption methods use real, unpredictable events instead of a
seed and function. An innovative example is using lava lamps to create encryption keys. A wall of lava
lamps, changing in a totally random way, was set up to encrypt 10% of the web. This shows how the
unpredictability of real-world events can make computer security stronger without spending a lot.

Now Adrien will conclude