- pseudorandom
-
pseu·do·ran·dom (so͞o'dō-rănʹdəm)
adj.
Of, relating to, or being random numbers generated by a definite, nonrandom computational process.
* * *
Universalium. 2010.
pseudorandom
Look at other dictionaries:
Pseudorandom generator theorem — In computational complexity a distribution is considered pseudorandom if no efficient computation can distinguish it from the true uniform distribution by a non negligible advantage. Formally, a family of distributions Dn is pseudorandom if for… … 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
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 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 function family — In cryptography, a pseudorandom function family, abbreviated PRF, is a collection of efficiently computable functions which emulate a random oracle in the following way: No efficient algorithm can distinguish (with significant advantage) between… … Wikipedia
Pseudorandom number sequence — A Pseudorandom number sequence is a sequence of numbers that has been computed by some defined arithmetic process but is effectively a random number sequence for the purpose for which it is required. Although a pseudorandom number sequence in… … Wikipedia
Pseudorandom encoder — A pseudorandom encoder is an electro mechanical device used for measuring distance and finding position. It is different from the conventional absolute and incremental encoder in its disk pattern, which gives it aspects of the other two… … Wikipedia
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 permutation — In cryptography, a pseudorandom permutation, abbreviated PRP, is an idealized block cipher. It means the cipher that cannot be distinguished from a random permutation (that is, a permutation selected at random with uniform probability, from the… … Wikipedia
Pseudorandom ensemble — Let U = {U n} {n in mathbb{N be a uniform ensembleand X = {X n} {n in mathbb{N be an ensemble. The ensemble X is called pseudorandom if X and Uare indistinguishable in polynomial time.References* Goldreich, Oded (2001). Foundations of… … Wikipedia
pseudorandom number — pseudoatsitiktinis skaičius statusas T sritis automatika atitikmenys: angl. pseudorandom number vok. Pseudozufallszahl, f rus. псевдослучайное число, n pranc. nombre pseudo aléatoire, m … Automatikos terminų žodynas
