Pseudorandom number generators Pseudorandom number generators : AFSR also stands for the Argonne Fast Source Reactor ** -- see list of nuclear reactors. ...more on Wikipedia about "AFSR"
Blum Blum Shub (BBS) is a pseudorandom number generator proposed in 1986 by Lenore Blum, Manuel Blum and Michael Shub (Blum et al, 1986). ...more on Wikipedia about "Blum-Blum-Shub pseudorandom number generator"
A cryptographically secure pseudo-random number generator (CSPRNG) is a pseudo-random number generator (PRNG) with properties that make it suitable for use in cryptography. ...more on Wikipedia about "Cryptographically secure pseudorandom number generator"
E0 is a stream cipher used in the Bluetooth protocol. It generates a sequence of pseudorandom numbers and combines it with the data using the XOR operator. The key length may vary, but is generally 128 bits. ...more on Wikipedia about "E0 (cipher)"
The FISH (FIbonacci SHrinking) stream cipher is a fast software based stream cipher using Lagged Fibonacci generators, plus a concept from the shrinking generator cipher. It was published by Siemens in 1993. FISH is quite fast in software and has a huge key length. However, in the same paper where he proposed Pike, Ross Anderson showed that FISH can be broken with just a few thousand bits of known plaintext. ...more on Wikipedia about "FISH (cipher)"
Fortuna is a cryptographically secure pseudo-random number generator (PRNG) devised by Bruce Schneier and Niels Ferguson. It is named for Fortuna, the Roman goddess of chance. ...more on Wikipedia about "Fortuna (PRNG)"
Inversive congruential generators are a type of nonlinear congruential pseudorandom number generator, which use the modular multiplicative inverse (if it exists) to generate the next number in a sequence. The standard formula for an inversive congruential generator is: ...more on Wikipedia about "Inversive congruential generator"
Visit again shortopedia Pseudorandom_number_generators
ISAAC is a pseudorandom number generator designed by Bob Jenkins ( 1996) to be cryptographically secure. The name is an acronym for Indirection, Shift, Accumulate, Add, and Count. ...more on Wikipedia about "ISAAC (cipher)"
A Lagged Fibonacci generator (LFG) is an example of a pseudorandom number generator. This class of random number generator is aimed at being an improvement on the 'standard' linear congruential generator. These are based on a generalisation of the Fibonacci sequence. ...more on Wikipedia about "Lagged Fibonacci generator"
Lavarand™ is Silicon Graphics' name for its method of generating pseudo-random numbers out of the patterns made by the floating material in lava lamps. ...more on Wikipedia about "Lavarand"
Linear congruential generators (LCGs) represent one of the oldest and best-known pseudorandom number generator algorithms. ...more on Wikipedia about "Linear congruential generator"
A linear feedback shift register (LFSR) (sometimes called PN Sequences register) is a shift register whose input is the exclusive-or (xor) of some of its outputs. ...more on Wikipedia about "Linear feedback shift register"
The following pseudorandom number generators are recommended for use in simulation. They have extremely long periods, low correlation, and pass most statistical tests. The routines described here are part of the GNU Scientific Library. ...more on Wikipedia about "List of pseudorandom number generators"
The Mersenne twister is a pseudorandom number generator developed in 1997 by Makoto Matsumoto (松本 眞) and Takuji Nishimura (西村 拓士). It provides for fast generation of very high quality pseudorandom numbers, having been designed specifically to rectify many of the flaws found in older algorithms. ...more on Wikipedia about "Mersenne twister"
This article is made for shortopedia
Clearly, for a generator of n-digit numbers, the period can be no longer than 10n. If the middle ten digits are all zeroes, the generator then outputs zeroes forever. If the first half of a number in the sequence is zeroes, the subsequent numbers will be decreasing to zero. While these runs of zero are easy to detect, they occur too frequently for this method to be of practical use. ...more on Wikipedia about "Middle-square method"
A pseudorandom number generator (PRNG) is an algorithm that generates a sequence of numbers, the elements of which are approximately independent of each other. ...more on Wikipedia about "Pseudorandom number generator"
Humans generally do poorly at generating random quantities. Magicians, gamblers and con artists make their livings off the predictability of human behavior. In World War II German code clerks were instructed to select three letters at random to be the initial rotor setting for each Enigma machine message. Instead some chose predictable values like girl-friends' names, greatly aiding allied breaking of these encryption systems. Another example is the often predictable ways computer users choose passwords. See: Password cracking. ...more on Wikipedia about "Random number generator attack"
A random seed (or seed state) is a number (or vector) used to initialize a pseudorandom number generator. ...more on Wikipedia about "Random seed"
RANDU is an infamous linear congruential pseudorandom number generator which has been used since the 1960s. It is defined by the recurrence: ...more on Wikipedia about "RANDU"
In cryptography, RC4 (or ARCFOUR) is the most widely-used software stream cipher and is used in popular protocols such as Secure Sockets Layer (SSL) (to protect Internet traffic) and WEP (to secure wireless networks). RC4 falls short of the high standards of security set by cryptographers, and some ways of using RC4 lead to very insecure cryptosystems (including WEP). It is not recommended for use in new systems. However, some systems based on RC4 are secure enough for practical use. ...more on Wikipedia about "RC4"
A self-shrinking generator is a pseudorandom number generator and a variant of the shrinking generator concept. It is a generator used in cryptography. ...more on Wikipedia about "Self-shrinking generator"
In cryptography, the shrinking generator is a form of pseudorandom number generator intended to be used in a stream cipher. It was published in 1993 by Don Coppersmith, Hugo Krawczyk and Yishay Mansour. ...more on Wikipedia about "Shrinking generator"
The Yarrow algorithm is a cryptographically secure pseudo-random number generator. The name is taken from the yarrow plant, the stalks of which are dried and used as a randomising agent in I Ching divination. ...more on Wikipedia about "Yarrow algorithm"
This article is licensed under the GNU Free Documentation License.
It uses material from the Wikipedia . Direct links to the original articles are in the text.
If you use exact copy or modified of this article you should preserve above paragraph and put also : It uses material from
the Shortopedia article about "Pseudorandom number generators".
| MAIN PAGE | MAIN INDEX | CONTACT US |