HEURISTIC APPROACH FOR FINDING ASYMPTOTICALLY RANDOM GFSR GENERATORS.

Shu Tezuka

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)178-182
Number of pages5
JournalJournal of information processing
Volume10
Issue number3
Publication statusPublished - 1987

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this