On a Non-periodic Shrinking Generator

Citations Over Time

Abstract

We present a new non-periodic random number generator based on the shrinking generator. The A-sequence is still generated using a LFSR, but the S-sequence is replaced by a finitely generated bi-ideal - a non-periodic sequence. The resulting pseudo-random sequence performs well in statistical tests. We show a method for the construction of an infinite number of finitely generated bi-ideals from a given A-sequence, such that the resulting sequence of the shrinking generator is nonperiodic. Further we prove the existence of what we call universal finitely generated bi-ideals that produce non-periodic words when used as the S-sequence of a shrinking generator for all non-trivial periodic A-sequences.

Related Papers

• → Construction and Comparison of High-Dimensional Sobol' Generators(2011)206 cited
• → Some conditions under which slow oscillation of a sequence of fuzzy numbers follows from Ces`{a}ro summability of its generator sequence(2014)8 cited
• SOME CONDITIONS UNDER WHICH SLOW OSCILLATION OF A SEQUENCE OF FUZZY NUMBERS FOLLOWS FROM CESARO SUMMABILITY OF ITS GENERATOR SEQUENCE(2014)
• → A New Self-Shrinking Generator(2022)1 cited
• Construction and Analysis of Shrinking-extended Generator(2009)