Pseudorandom number generator

Known as: Pseudorandom sequence, PN sequence, Rand 
A pseudorandom number generator (PRNG), also known as a deterministic random bit generator (DRBG), is an algorithm for generating a sequence of… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We propose a novel pseudorandom number generator based on Rössler attractor and bent Boolean function. We estimated the output… (More)
  • figure 1
  • figure 2
  • table I
  • table II
  • table III
Is this relevant?
2016
2016
  • MULTIPRIME BLUM-BLUM-SHUB
  • 2016
Blum-Blum-Shub (BBS) is a (probabilistically) secure pseudorandom bit/number generator which outputs a sequence by repeatedly… (More)
  • figure 4.1
  • figure 4.2
  • figure 4.3
  • figure 4.4
  • figure 4.5
Is this relevant?
2014
2014
We describe a new algorithm SplitMix for an object-oriented and splittable pseudorandom number generator (PRNG) that is quite… (More)
  • figure 2
  • table 2
  • table 1
  • figure 19
  • table 3
Is this relevant?
2012
2012
Performance and fault tolerance, FT, are two dominant issues during development of complex real-time embedded systems, RT_ES. FT… (More)
  • figure 1
  • table I
  • figure 3
  • figure 2
  • figure 6
Is this relevant?
2012
2012
The Linux pseudorandom number generator (PRNG) is a PRNG with entropy inputs which is widely used in many security related… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Mersenne Twister (MT) is a widely-used fast pseudorandom number generator (PRNG) with a long period of 2 − 1, designed 10 years… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2005
2005
Let p be a prime and let a and b be elements of the finite field Fp of p elements. The inversive congruential generator (ICG) is… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show how to construct a… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A new algorithm called Mersenne Twister (MT) is proposed for generating uniform pseudorandom numbers. For a particular choice of… (More)
  • table I
  • table II
Is this relevant?
1970
1970
Intermediate computations in an “Extremely Portable Random Number Generator” by J. B. Kruskal [<italic>Comm. ACM 12</italic>, 2… (More)
Is this relevant?