Guaranteeing the diversity of number generators

DOI10.1006/INCO.2001.3045zbMATH Open1013.94013arXivcs/0112014OpenAlexW2069101763MaRDI QIDQ1854489FDOQ1854489

Authors: Adi Shamir, Boaz Tsaban 

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/cs/0112014

Recommendations

• Design of Practical and Provably Good Random Number Generators
• scientific article; zbMATH DE number 1103064
• scientific article; zbMATH DE number 2086718
• scientific article; zbMATH DE number 910854
• Secure and fast encryption (SAFE) with classical random number generators

zbMATH Keywords

cryptographysequence diversityiterative number generators

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Title not available (Why is that?)
• On the construction of pseudorandom permutations: Luby-Rackoff revisited
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Faster Luby-Rackoff ciphers
• Bernoulli numbers and the probability of a birthday surprise
• Efficient linear feedback shift registers with maximal period
• Periods of some nonlinear shift registers
• On the cycle structure of a set of nonlinear shift registers with symmetric feedback functions
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Pseudo-random number generator based on asymptotic deterministic randomness
• Algebraic dependence in generating functions and expansion complexity
• Secure communication scheme based on asymptotic model of deterministic randomness
• Bernoulli numbers and the probability of a birthday surprise
• Discrete asymptotic deterministic randomness for the generation of pseudorandom bits
• ON THE DISTRIBUTION OF COUNTER-DEPENDENT NONLINEAR CONGRUENTIAL PSEUDORANDOM NUMBER GENERATORS IN RESIDUE RINGS
• Separation of random number generation and resolvability

This page was built for publication: Guaranteeing the diversity of number generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854489)