PRNG


Also found in: Acronyms.

PRNG

(Pseudo-Random Number Generator) See pseudo-random numbers.
Copyright © 1981-2019 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.
References in periodicals archive ?
The tests of this PRNG were done by using NIST STS-1.6.
This intact part includes the least significant bits of the permutation, when processed by the Pseudo Random Number Generator (PRNG) algorithm, it determines the least significant bits of the allegedly pseudorandom output stream along a long prefix of the stream.
In the second section, the structures and properties of PRNG and TRNG are briefly explained.
A node has to compute 16-bit PRNG, 8-bit time stamp, and 8-bit permuting of selective data to secure perturbing function.
The PRNG parameters are [x.sup.1.sub.0] = 0.68775492511773, [x.sup.2.sub.0] = -0.0134623354671, [r.sub.1] = 5.938725025421, and [r.sub.2] = 1.257490188615.
In the field of chaos-based communication and for practical considerations, a design guide of a computationally efficient PRNG using chaotic systems with finite precision is needed.
An RN16 drawn from a tag's PRNG 10 ms after the end of tag power-up rise time, shall not be predictable with a probability greater than 0.025%.
PRNG is an algorithm for creating a sequence of numbers whose properties almost equal to the properties of sequences of random numbers.
A set of 500 random vectors are generated by a PRNG named Blum-Blum Shub (BBS).