PRBGPseudorandom Bit Generator (cryptography)
Copyright 1988-2018, All rights reserved.
References in periodicals archive ?
That allows to decorrelate the outputs of the PRBG, and then increase the sensitivity related to the initial seeds.
The quality of the output sequences produced by any PRBG is the crucial element.
The analysis consists in evaluating the randomness level of the sequences generated by the PRBG. In the literature, various statistical tests exist for analysing the randomness level of sequences.
One can remark that, for the proposed PRBG, all the tested sequences pass successfully the NIST tests.
For the proposed PRBG, around 99.56% of the coefficients have an absolute value smaller than 0.09, then only a small correlation is detected.
Iterate the Duffing map based PRBG to produce mxnx 24 bits.
The key of the proposed image encryption scheme is that it is produced by the combination of Chebyshev polynomial based PRBG and Duffing map based PRBG.
In Section 2, we propose two pseudorandom bit generators (PRBGs): one based on Chebyshev polynomial and the other based on Duffing map.
In this paper, we propose a pseudo random bit generator (PRBG) based on two chaotic logistic maps.
In the next section, we discuss the basic terminology for the random bit generation and details of the proposed pseudo random bit generator (PRBG).
In such situations, the problem can be ameliorated by replacing a random bit generator with a pseudo random bit generator (PRBG).
A pseudo random bit generator (PRBG) is a deterministic algorithm, which uses a truly random binary sequence of length k as input called seed and produces a binary sequence of length l>>k, called pseudo random sequence, which appears to be random.