About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of information processing
Paper
HEURISTIC APPROACH FOR FINDING ASYMPTOTICALLY RANDOM GFSR GENERATORS.
Abstract
A heuristic approach for finding asymptotically random GFSR generators is proposed. The basic idea of this approach is the use of random search at the construction of generator matrices for asymptotically random GFSR sequences. By using this approach, five 31-bit asymptotically random GFSR generators with a prime period, 2**1**2**7 minus 1, were efficiently found.