Geradores de Números Pseudo-Aleatórios de Alta Taxa Baseados no Mapa de Arnold Discreto

In this work we propose two pseudo-random number generators (PRNG) based on the discrete Arnold map over the integer ring Z2^m. The first PRNG employ or-exclusive (XOR) and permutation between bits, discarding multiplication operations. The second PRNG proposes a methodology to increase the dimension of the generated sequences, increasing the rate bits/sample. The statistical properties of the PRNGs are analyzed using the statistical suite NIST. The proposed PRNGs are implemented in the FPGA (field-programmable gate array) Xilinx Virtex-5 and their hardware consumption is analyzed. We show that the maximum throughput obtained by one of the proposed PRNGs is 17 Gb/s, which is 2,4x the throughput obtained by state of the art schemes.