
- 1 DAVIES, A C. Further notes on delayed versions of linear binary sequences. Electron Letters 1, 7 (Sept. 1965), 190-191Google Scholar
- 2 HURD, W J Efficient generation of statlsUcally good pseudonolse by linearly interconnected shift registers. IE~~ Trans Comptrs C-23, 2 (Feb 1974), 146-152Google Scholar
- 3 KENDALL, M G, AND SMITH, B B, Randomness and random sampling numbers, d Roy Stattst Soc I01 (1938), 162-164.Google Scholar
- 4 LATAWIEC, K J A new method of generauon of shifted-linear pseudorandom bmary sequences Proc IEE 121, 8 (Aug. 1974), 905-906Google Scholar
- 5 LEWIS, T G, AND PAYI'~E, W H Generahzed feedback shift register pseudorandom number algorithm J ACM 20, 3 (July 1973), 456--468 Google Scholar
- 6 MARITSAS, D G., ARVILLIAS, A E, AND BOUNAS, A. Phase shift analys~s of linear shift register structures generating pseudorandom sequences To appear m IEEE Trans Comptrs Google Scholar
- 7 OBERMAN, R.M.M Dtsctphnes m Combmattonal and Sequential Circu# Design. McGraw-Hill, New York, 1970, pp. 474-484.Google Scholar
- 8 TAUSWORTHE, R C Random numbers generated by linear recurrence modulo two Math Comput 19 (1965), 201-209Google Scholar
- 9 TOOTILL, J P R, ROBINSON, W.D, AND ADAMS, A G The runs up-and-down performance of Tausworthe pseudo-random number generators. J. ACM 18, 3 (July 1971), 381-399 Google Scholar
- 10 TOOTILL, J P.R, ROBINSON, W.D, AND E^OLE, D.J An asymptotically random Tausworthe sequence. J.A CM 20, 3 (July 1973), 469-481. Google Scholar
- 11 WHITTLESEY, J.RB A comparison of the correlauonal behawor of random number generators for the IBM 360. Comm ACM 11, 9 (Sept. 1968), 641-644 Google Scholar
- 12 ZIERLER, N, AND BRILLHART, J On prlmmve trmommls (rood2), II, Inform. Contr. 14 (1969), 566-569Google Scholar
Index Terms
Partitioning the Period of a Class of m-Sequences and Application to Pseudorandom Number Generation
Recommendations
Splittable pseudorandom number generators using cryptographic hashing
Haskell '13We propose a new splittable pseudorandom number generator (PRNG) based on a cryptographic hash function. Splittable PRNGs, in contrast to linear PRNGs, allow the creation of two (seemingly) independent generators from a given random number generator. ...
Hyperchaotic system‐based pseudorandom number generator
Pseudorandom sequences are very important in the field of cryptography. The characteristics such as non‐linearity and random‐like behaviours make chaotic systems suited to generate pseudorandom sequences. However, most of chaos‐based pseudorandom number ...
Fast splittable pseudorandom number generators
OOPSLA '14: Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & ApplicationsWe describe a new algorithm SplitMix for an object-oriented and splittable pseudorandom number generator (PRNG) that is quite fast: 9 64-bit arithmetic/logical operations per 64 bits generated. A conventional linear PRNG object provides a generate ...






Comments