Guaranteeing the diversity of number generators

Details Guaranteeing the diversity of number generators Guaranteeing the diversity of number generators

2001-12-12

arxiv.org/abs/cs/0112014v5

Information and Computation 171 (2001), 350--363

Computer Science

Cryptography and Security

Small updates

Scientific paper

10.1006/inco.2001.3045

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.

Affiliated with

Also associated with

No associations

Rating

Guaranteeing the diversity of number generators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Guaranteeing the diversity of number generators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Guaranteeing the diversity of number generators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-82423