Random numbers often serve as the backbone for many security solutions in diverse domains such as cryptography, side channel leakage prevention, and moving target defense. However, generating true ...

Constructive mathematical method of decoding the pseudorandom code based on the use of branch and bound method are considered. Modification of the classical algorithm of branch and bound is proposed, ...

With so many people using devices that can be connected to the internet, reliably securing wireless communications and protecting the data they are exchanging is of growing importance. While computer ...

PRNG D 64 is a high-performance pseudorandom number generator that produces 64-bit integers with a minimum period of 2²⁵⁶. It efficiently generates statistically strong random numbers, making it ...

Existing pseudorandom number generators (PRNGs) face limitations such as periodic behavior, dependence on high-quality entropy sources, or computational inefficiency. On the other hand, chaotic ...

Fortunately, a linearly recurring sequence generator [2] can be written in somewhat “portable” ASA Standard FORTRAN which will produce maximum length [2** (word size of computer - 1) -1] pseudorandom ...

An alogorithm is described by which uniform pseudorandom integers may be used to construct binary “numbers” in which the probability that each bit in the word is a 1-bit and can assume any desired ...

Towards the goal of improving functional and performance portability of SYCL, we study a bioinformatics application that has been accelerated with CUDA and fast pseudorandom number generation on a GPU ...

We give new pseudorandom generators for regular read-once branching programs of small width. A branching program is regular if the in-degree of every vertex in it is either 0 or 2. For every width d ...

Add a description, image, and links to the pseudorandom-function topic page so that developers can more easily learn about it ...