Efficient deterministic and non-deterministic pseudorandom number generation

Jie Li, Jianliang Zheng and Paula Whitlock

Mathematics and Computers in Simulation (MATCOM), 2018, vol. 143, issue C, 114-124

Abstract: A high performance and high quality pseudorandom number generator is presented in this paper. It takes less than one clock cycle to generate a pseudorandom byte on an Intel core i3 processor and passes all the 6 TestU01 batteries of tests. The generator can work in either deterministic mode or non-deterministic mode. When working in deterministic mode, it can be used for high speed data encryption and in other applications that require deterministic and reproducible pseudorandom sequences. When working in non-deterministic mode, the generator behaves much like a true random number generator, but with the advantages of low cost, high performance, and general availability. It is good for many applications that currently rely on true random number generators

Keywords: Pseudorandom number generator; Non-deterministic; Randomness; Performance; Cryptanalysis (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475416301227
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:143:y:2018:i:c:p:114-124

DOI: 10.1016/j.matcom.2016.07.011

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().