prbits

this function generates random bits of desired length

Provides functions for generating pseudo-random numbers that follow a uniform distribution [0,1]. Randomness tests were conducted using the National Institute of Standards and Technology test suite<https://csrc.nist.gov/pubs/sp/800/22/r1/upd1/final>, along with additional tests. The sequence generated depends on the initial values and parameters. The package includes a linear congruence map as the decision map and three chaotic maps to generate the pseudo-random sequence, which follow a uniform distribution. Other distributions can be generated from the uniform distribution using the Inversion Principle Method and BOX-Muller transformation. Small perturbations in seed values result in entirely different sequences of numbers due to the sensitive nature of the maps being used. The chaotic nature of the maps helps achieve randomness in the generator. Additionally, the generator is capable of producing random bits.

Sajad Ahmad Mir

PRNG

A Pseudo-Random Number Generator

Dr. Puneet Sharma

prbits function

<dl><dt>n</dt>
<dd>number of bits required</dd>
<dt>Time</dt>
<dd>it is a boolean value of TRUE/FALSE if we want to generate time dependent random bits.i.e each time we call the function with same input different output will be generated.</dd></dl>

Arguments

Random Bit generator — prbits

<dl>

<dt>n</dt>
<dd>number of bits required</dd>


<dt>Time</dt>
<dd>it is a boolean value of TRUE/FALSE if we want to generate time dependent random bits.i.e each time we call the function with same input different output will be generated.</dd>

</dl>

prbits: Random Bit generator

Description

Usage

Value

Arguments

Examples