Uniform Generators and Combinatorial Designs
The concept of randomness is fundamental in many domains and in particular in cryptography. Intuitively, a system, which is unpredictable is more difficult to attack and as a consequence, creating sequences that look like random represents a major issue. In this paper, the authors first study theoretically how a source of symbols with positive entropy can be turned into a true random generator called Bernoulli. They concentrate on a special type of generators, which consists in randomly choosing k elements out of n elements. After studying some existing algorithms, which are of Las Vegas type, they introduce new constructions from a binary generator taken as a primary random source of symbols.