Guaranteeing the diversity of number generators

@article{Shamir2001GuaranteeingTD,
  title={Guaranteeing the diversity of number generators},
  author={Adi Shamir and Boaz Tsaban},
  journal={IACR Cryptology ePrint Archive},
  year={2001},
  volume={2003},
  pages={132}
}
A major problem in using iterative number generators of the form xi = f (xi−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 noniterative generators. We then introduce the class of counter-assisted… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Stream Ciphers and Number Theory,

  • T. W. Cusick, C. Ding, A. Renvall
  • North-Holland Mathematical Library,
  • 1998

Similar Papers

Loading similar papers…