The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Gambling tests for pseudorandom number generators
Mathematics and Computers in Simulation - IMACS sponsored Special issue on the second IMACS seminar on Monte Carlo methods
Shift Register Sequences
TestU01: A C library for empirical testing of random number generators
ACM Transactions on Mathematical Software (TOMS)
Cryptography Engineering: Design Principles and Practical Applications
Cryptography Engineering: Design Principles and Practical Applications
Hi-index | 0.00 |
Many fields need random and pseudorandom numbers, especially in cryptographic applications. d-bit segment binary pseudorandom numbers can be more easily used for block encryption. This paper studies on the statistical test for binary d string pseudorandom number generator (PRNG). Three postulates on the randomness for ideal pseudorandom d-bit segment sequences have been proposed. Based on the FIPS140-2 tests, a statistical test suite for d-bit segment sequences generated by PRNG has been proposed. Using the test suite tests the 100 key streams generated by RC4 PRNG and Matlab PRNG, respectively. The test results show that in the two 100 key streams generated via the two PRNGs with different seeds, about 97% 8-bit strings have passed the test suite, respectively. Using the key streams generated via the two PRNGs encrypts an RGB image. The results have shown that the encrypted RGB images have significant stream encryption avalanche effect.