Description
The Linux random number generator is part of the kernel since 1994. It collects entropy from user input, interrupts and disk movements and claims to output high quality random numbers. There are two different versions: /dev/random which blocks if the internal entropy count goes to zero and /dev/urandom which is faster since it produces as many bits as the user wants to. The only official definition of this RNG exists in the code itself which is subject to possible changes in new releases of the kernel. We want to give a detailed description of the current version. There exists previous attempts of describing this generator, especially the works of Barak and Halevi in 2005 and Gutterman et al. in 2006. However, the generator changed in the meantime and we want to describe it in more mathematical details.
Prochains exposés
-
MIKE: An efficient and compact NIKE Based on a Commutative Monoidal Action
Orateur : Jonathan Komada Eriksen - COSIC, KU Leuven
Robert recently described a powerful correspondence between certain (Hermitian) modules and (polarized) abelian varieties, which simultaneously generalizes both the class-group action underlying protocols such as CSIDH, and the Deuring correspondence, underlying protocols such as SQIsign. Using this correspondence, he also proposed how to construct a post-quantum NIKE, called MIKE, which, at a[…]-
Cryptography
-
-
TBA
Orateur : Anmoal Porwal - Technical University of Munich
-
Cryptography
-
Asymmetric primitive
-