Pseudorandom Number Generator Using Optimal Normal Basis
This paper proposes a simple pseudorandom number generator [PRNG] by using optimal normal basis. It is well known that the squaring and multiplication in finite field with optimal normal basis is very fast and the basis can be transformed to a canonical form. The suggested PRNG algorithm combines typical multiplications and exclusive-or bit operations, both operations can be easily implemented. It is shown that the algorithm passes all terms of the Diehard and the ENT tests for long sequences. This algorithm can be applied in various applications such as financial cryptography.
KeywordsSeed Size Test Suite Random Seed Pseudorandom Number Generator Binary File
Unable to display preview. Download preview PDF.
- 1.Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., Dray, J., Vo, S.: A statistical test suite for random and pseudorandom number generators for cryptographic applications. NIST Special Publication 800-22 (2001), http://www.nist.gov/
- 8.Walker, J.: ENT, A pseudorandom number sequence test program (1998), http://www.fourmilab.ch/random/
- 11.Marsaglia, G.: Diehard battery of tests of randomness (1995), http://www.stat.fsu.edu/pub/diehard/