Guaranteeing the diversity of number generators

Abstract

A major problem in using iterative number generators of the form x_i=f(x_{i-1}) is that they can enter unexpectedly short cycles. This is hard to analyze when the generator is designed, hard to detect in real time when the generator is used, and can have devastating cryptanalytic implications. In this paper we define a measure of security, called_sequence_diversity_, which generalizes the notion of cycle-length for non-iterative generators. We then introduce the class of counter assisted generators, and show how to turn any iterative generator (even a bad one designed or seeded by an adversary) into a counter assisted generator with a provably high diversity, without reducing the quality of generators which are already cryptographically strong.

Small updates

References in corpus (2)

• Efficient linear feedback shift registers with maximal period
• Bernoulli numbers and the probability of a birthday surprise

Cited by in corpus (6)

• Pseudo-random number generator based on asymptotic deterministic randomness
• Secure Communication Scheme Based on Asymptotic Model of Deterministic Randomness
• Bernoulli numbers and the probability of a birthday surprise
• Wreath Products in Stream Cipher Design
• Pseudorandom number generation by p-adic ergodic transformations: an addendum
• Non-Archimedean analysis, T-functions, and cryptography