HEURISTIC APPROACH FOR FINDING ASYMPTOTICALLY RANDOM GFSR GENERATORS.

Shu Tezuka

Research output: Contribution to journalArticle

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
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

HEURISTIC APPROACH FOR FINDING ASYMPTOTICALLY RANDOM GFSR GENERATORS. / Tezuka, Shu.

In: Journal of Information Processing, Vol. 10, No. 3, 1987, p. 178-182.

Research output: Contribution to journalArticle

@article{40267c13ea94447f8e771cdc37467680,
title = "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.",
author = "Shu Tezuka",
year = "1987",
language = "English",
volume = "10",
pages = "178--182",
journal = "Journal of Information Processing",
issn = "0387-6101",
publisher = "Information Processing Society of Japan",
number = "3",

}

TY - JOUR

T1 - HEURISTIC APPROACH FOR FINDING ASYMPTOTICALLY RANDOM GFSR GENERATORS.

AU - Tezuka, Shu

PY - 1987

Y1 - 1987

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0023601094&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023601094&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0023601094

VL - 10

SP - 178

EP - 182

JO - Journal of Information Processing

JF - Journal of Information Processing

SN - 0387-6101

IS - 3

ER -