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 language | English |
|---|---|
| Pages (from-to) | 178-182 |
| Number of pages | 5 |
| Journal | Journal of information processing |
| Volume | 10 |
| Issue number | 3 |
| Publication status | Published - 1987 |
All Science Journal Classification (ASJC) codes
- Computer Science(all)