An algorithm to fill out a bloc with pseudorandom binary data

Pseudorandom bits generation is very relevant for several fields including Monte-Carlo simulation, procedural generation and applied cryptography. Usually, pseudorandom bits are generated as a sequence, bit by bit. A different approach is followed in this paper, considering how to fill a fixed size bloc with pseudorandom bits. An algorithm to solve this problem as well as pseudorandomness testing results are given. In this new algorithm an input of n bits generates an output of O(2n) pseudorandom bits. Experimental results show that the proposed algorithm generates binary data with good pseudorandom properties.