Yoshiharu Kurita

Learn More
The twisted GFSR generators proposed in a previous article have a defect in <italic>k</italic>-distribution for <italic>k</italic> larger than the order of recurrence. In this follow up article, we introduce and analyze a new TGFSR variant having better <italic>k</italic>-distribution property. We provide an efficient algorithm to obtain the order of(More)
The generalized feed back shift register (GFSR) algorithm suggested by Lewis and Payne is a widely used pseudorandom number generator, but has the following serious drawbacks: (1) an initialization scheme to assure higher order equidistribution is involved and is time consuming; (2) each bit of the generated words constitutes an <italic>m</italic>-sequence(More)
All primitive trinomials over GF (2) with degree 859433 (which is the 33rd Mersenne exponent) are presented. They are X859433 +X288477 + 1 and its reciprocal. Also two examples of primitive pentanomials over GF (2) with degree 86243 (which is the 28th Mersenne exponent) are presented. The sieve used is briefly described.
  • 1