Gal Badishi, Idit Keidar, et al.
IEEE TDSC
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, 212**7 minus 1, were efficiently found.
Related
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering
Conference paper
QALD-3: Multilingual question answering over linked data
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum