Random numbers are a fundamental tool in many cryptographic applications like key
generation, encryption, masking protocols, or for internet gambling. We require generators …

A large number of cryptographic applications require random numbers, eg, as session keys,
signature parameters, ephemeral keys (DSA, ECDSA), challenges or in zero-knowledge …

In this paper, we present approaches to generating random numbers, along with potential
applications. Rather than trying to provide extensive coverage of several techniques or …

Random numbers are critical in every aspect of cryptography. We need such numbers to
encrypt e-mails, to digitally sign documents, for electronic payment systems, and so on …

Random number generators are essential components of many cryptographic systems.
Inappropriate random number generators may weaken the security properties of the system …

In the previous chapter we first addressed general aspects of random number generators
(RNGs) that are used for cryptographic applications. We divided the entirety of RNGs into …

We present a construction for a family of pseudo-random generators that are very fast in
practice, yet possess provable statistical and cryptographic unpredictability properties. Such …

Randomness plays an important role in multiple applications in cryptography. It is required
in fundamental tasks such as key generation, masking and hiding values, nonces and …

Introduction Basic definitions Uses of pseudo-random generators The paradoxical aspect of
pseudo-random number generators. Fields of science that deal with pseudo-random …

This paper discusses some aspects of selecting and testing random and pseudorandom
number generators. The outputs of such generators may be used in many cryptographic …