Pseudorandom number generator using optimal normal basis

Authors:
Injoo Jang;Hyeong Seon Yoo
Affiliations:
School of Computer Science and Engineering, Inha University, Incheon, Korea;School of Computer Science and Engineering, Inha University, Incheon, Korea
Venue:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Year:
2006

Citing 4
Cited 0

Optimal normal bases in GF(pn)

Discrete Applied Mathematics
The efficient generation of cryptographic confusion sequences

Cryptologia
An Efficient Optimal Normal Basis Type II Multiplier

IEEE Transactions on Computers
Random number generation with primitive pentanomials

ACM Transactions on Modeling and Computer Simulation (TOMACS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.