- Pseudorandom number sequence
A

**Pseudorandom number sequence**is asequence of numbers that has been computed by some defined arithmetic process but is effectively arandom number sequence for the purpose for which it is required.Although a pseudorandom number sequence in this sense often appears to lack any definite pattern, any pseudorandom number generator with a finite internal state will repeat after a very long sequence of numbers. This can be proved using the

pigeonhole principle .**ee also***

Pseudo-random binary sequence

*Pseudo-random number

*Pseudorandom number generator

*Wikimedia Foundation.
2010.*

### Look at other dictionaries:

**Pseudorandom binary sequence**— A binary sequence (BS) is a sequence of N bits, :a j for j=0,1,...,N 1, i.e. m ones and N m zeros. A BS is pseudo random (PRBS) if its autocorrelation function :C(v)=sum {j=0}^{N 1} a ja {j+v}has only two values::C(v)=egin{cases}m, mbox{ if }… … Wikipedia**Pseudorandom number generator**— A pseudorandom number generator (PRNG), also known as a deterministic random bit generator (DRBG),[1] is an algorithm for generating a sequence of numbers that approximates the properties of random numbers. The sequence is not truly random in… … Wikipedia**pseudorandom number generator**— noun A device or algorithm that deterministically produces a succession of values that appear in an unpredictable sequence or apparently random order … Wiktionary**Cryptographically secure 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. Many aspects of cryptography require random numbers, for example: Key… … Wikipedia**Pseudorandom noise**— In cryptography, pseudorandom noise (PRN[1][2]) is a signal similar to noise which satisfies one or more of the standard tests for statistical randomness. Although it seems to lack any definite pattern, pseudorandom noise consists of a… … Wikipedia**Pseudorandom generator**— In theoretical computer science, a pseudorandom generator is a deterministic method of generating a large amount of pseudorandom, or apparently random, data, from a small amount of initial random data. The initial data is commonly known as a… … Wikipedia**Naor-Reingold Pseudorandom Function**— In 1997, Moni Naor and Omer Reingold described efficient constructions for various cryptographic primitives in private key as well as public key cryptography. Their result is the construction of an efficient pseudorandom function. Let p and l be… … Wikipedia**Hardware random number generator**— This SSL Accelerator computer card uses a hardware random number generator to generate cryptographic keys to encrypt data sent over computer networks. In computing, a hardware random number generator is an apparatus that generates random numbers… … Wikipedia**Fermat number**— In mathematics, a Fermat number, named after Pierre de Fermat who first studied them, is a positive integer of the form:F {n} = 2^{2^{ overset{n} {} + 1where n is a nonnegative integer. The first nine Fermat numbers are OEIS|id=A000215:As of|2008 … Wikipedia**Random number generation**— A random number generator (often abbreviated as RNG) is a computational or physical device designed to generate a sequence of numbers or symbols that lack any pattern, i.e. appear random. Computer based systems for random number generation are… … Wikipedia