pseudo-random numbers

(redirected from Pseudorandomness)
Also found in: Dictionary, Wikipedia.
Related to Pseudorandomness: Pseudorandom numbers

pseudo-random numbers

A set of values or elements that is statistically random, but it is derived from a known starting point and is typically repeated over and over. Pseudo-random numbers provide necessary values for processes that require randomness, such as creating test signals or for synchronizing sending and receiving devices in a spread spectrum transmission. It is called "pseudo" random, because the algorithm can repeat the sequence, and the numbers are thus not entirely random. See CDMA and PN sequence.
References in periodicals archive ?
Biased keys are able to reveal the pseudorandomness of the approach and the key is deduced further by applying differential methods or fault injection as shown before.
Sarkozy, On finite pseudorandom binary sequences I: measure of pseudorandomness, the Legendre symbol, Acta Arithmetica, 82 (1997), pp.
Proposition 1: The protocol [PI] induces a computational Nash equilibrium given that 0 < [alpha] < 1, U > [alpha] x [U.sup.*] + (1 - [alpha]) x [U.sub.rand], and the pseudorandomness of VRFs.
It proved to be a good tool in analyzing the degree of pseudorandomness of cryptographic systems.
Beck (mathematics, Rutgers) examines the solid-liquid-gas conjecture as to whether discrete systems are either simple or they exhibit advanced pseudorandomness with or without constraints.
Let [Adv.sup.prf.sub.F] (k,T,q,h) denote the maximum advantage which is over all adversaries As that break the pseudorandomness of F with time complexity T making at most q oracle queries and the sum of the length of these queries being at most h bits.
The problem with pinning our hopes on quantum randomness is pseudorandomness. In computation theory, pseudo-randomness refers to a type of algorithm that is deterministic (i.e.
From a macro substantive perspective, there seems little difference between these complex oscillations and pseudorandomness, since the level of longitudinal complexity is sufficiently high to make a practical ability to predict the future virtually impossible.
[absolute value of Pr[[G.sub.2](A) = 1] = Pr[[G.sub.3](A) = 1]] [less than or equal to] [[epsilon].sub.prf], where [[epsilon].sub.prf] represents the probability in the pseudorandomness definition of PRF.
As a type of complex nonlinear system, chaotic systems have initial value sensitivity, pseudorandomness, and nonperiodicity, which are consistent with the characteristics required for cryptography.
In order to test the pseudorandomness of the CPRNG, we transform the 16-bit stream defined by (36) to the {0,1} bit stream as follows.
In any case, with all but negligible probability, the PRP key [K.sub.p] is not included; therefore the pseudorandomness of n guarantees that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] is indistinguishable from random.