Examples of using Pseudo-random in English and their translations into Russian
{-}
-
Official
-
Colloquial
The product is then put through a pseudo-random function.
The length of pseudo-random sequences- 2 4 -2 21 clock cycles(19 states);
Random_bytes- Generates cryptographically secure pseudo-random bytes.
The pseudo-random code is generated with a 9-stage shift register operating with a period of 1 ms.
Random_int- Generates cryptographically secure pseudo-random integers.
Three packets are sent at pseudo-random intervals reducing the possibility of RF packet collisions.
Also looking for a fixed codebook,which contains 512 pseudo-random codes.
The Dual_EC_DRBG cryptographic pseudo-random number generator from the NIST SP 800-90A is thought to contain a kleptographic backdoor.
Annotation: The article is devoted to methods of testing pseudo-random sequences.
The stream cipher then generates 2 bits of pseudo-random stream on each round which are xored starting at bit 64 of the packet.
Pseudo-random numbers are frequently used in simulation of statistical events, a very simple example being the outcome of tossing a coin.
The ziggurat algorithm is an algorithm for pseudo-random number sampling.
A Feistel network needs a source of pseudo-random values for the sub-keys for each round, and the output of the AES algorithm can be used as these pseudo-random values.
If called without the optional$min,$max arguments mt_rand()returns a pseudo-random value between 0 and mt_getrandmax.
Pseudo-random number sampling algorithms are used to transform uniformly distributed pseudo-random numbers into numbers that are distributed according to a given probability distribution.
Once the vector is generated, the elements of it are accessed in a pseudo-random order and combined to produce the derived key.
Stream ciphers, on the other hand, encrypt each digit of the plaintext at a time(usually in the form of a bit),with the help of a pseudo-random key stream.
It was the most complicated case of propagation of pulsed pseudo-random signals from the shelf into the deep sea in the presence of acoustic track the vortex formation.
The using possibilities of such matrices in solving the problem of constructing generalized generators of Galois pseudo-random sequences are discussed.
Such random number generators are called cryptographically secure pseudo-random number generators, and several have been implemented for example, the/dev/urandom device available on most Unixes, the Yarrow and Fortuna designs, server, and AT&T Bell Laboratories"truerand.
When the real phenomena are affected by unpredictable processes, such as radio noise or day-to-day weather,these processes can be simulated using random or pseudo-random numbers.
Methods of sampling a non-uniform distribution are typically based on the availability of a pseudo-random number generator producing numbers X that are uniformly distributed.
Cascadable programmable digital signal processor(DSP) with built-in reprogrammable logic(FPGA) for(de) multiplexing,(de-) serialization of data,generation of cyclic codes and pseudo-random sequences.
Simulacra within these"shadow worlds" can discover the false reality as they can only come up with pseudo-random numbers due to the nature of computers, leading them to"commit suicide" to escape the simulation.
For example, controversy surrounds the Voynich manuscript which could be a 16th-century fake cipher text,possibly constructed with a Cardan grille which was used to generate pseudo-random nonsense from a pre-existing text.
If one has a pseudo-random number generator whose output is"sufficiently difficult" to predict, one can generate true random numbers to use as the initial value(i.e., the seed), and then use the pseudo-random number generator to produce numbers for use in cryptographic applications.
A simple random sample can be drawn from a com- plete list of classes by the use of random number tables or the pseudo-random num- ber generator available in most statistical software packages.
RNG of this type accumulates minor entropy values over a long period of time, following that it is capable of issuing a truly random sequence having size of up to 640 bytes,afterwards, pseudo-random sequences will follow up until a new accumulation of entropy.
In theory andpractice of information cryptographic protection one of the key problems is the forming a binary pseudo-random sequences(PRS) with a maximum length with acceptable statistical characteristics.
A cryptographically secure random number generator may be a hardware random number generator, or it may be a cryptographically secure pseudo-random number generator(CSPRNG) using an algorithm such as Hash_DRBG, HMAC_DRBG, CTR_DRBG, Yarrow, or Fortuna.