A New Type of Random Number Generator for Software Implementation

A high efficient random number generators (RNGs) in simple structure with period 2^k-1 is presented, where k is the multiple of 32. Software implementation of these RNGs only require few fundamental instructions, such as XOR operations and circular rotation operations, as a result that they have a very high software efficiency and low memory consumption compared to some other RNGs. Meanwhile due to the good pseudo randomness of their output sequences, this RNGs may be used as a primitive building block in software oriented stream ciphers.