TY  - JOUR
T1  - Introduction to Secure PRNGs
AU - Babaei, Majid 
JO  - Journal of Modern Mathematics and Statistics
VL  - 5
IS  - 4
SP  - 84
EP  - 88
PY  - 2011
DA  - 2001/08/19
SN  - 1994-5388
DO  - jmmstat.2011.84.88
UR  - https://makhillpublications.co/view-article.php?doi=jmmstat.2011.84.88
KW  - Cryptography
KW  -chaotic random bit generator
KW  -NIST test suite
KW  -TestU01
KW  -PRNGs
KW  -Iran
AB  - Pseudo-Random Number Generators (PRNGs) are required for generating secret key in cryptographic algorithm, generating sequence of packet in the network simulation (workload generators) and the other applications in the various fields. In this study, there will be discussed a list of some requirements for generating reliable random sequence and then will be presented some PRNGs method which are based on combinational chaotic logistic map. In the final study after a brief introduction of two statistical test packets, TestU01 and NIST suite tests, the PRNG methods which are presented in this study will be appraised under these test packets and the results will be reported.
ER  -