This paper focuses on the design and implementation of a high-quality and high-throughput true-random number generator (TRNG) in FPGA. Various practical issues which we encountered are highlighted and the influence of the various parameters on the functioning of the TRNG are discussed. We also propose a few values for the parameters which use the minimum amount of the resources but still pass c...

A field programmable gate array (FPGA) -based implementation of a physical random number generator (PRNG) is presented. The PRNG uses an alternating step generator construction to decorrelate an oscillator-phase-noise-based physical random source. The resulting design can be implemented completely in digital technology, requires no external components, is very small in area, achieves very high ...

In this paper, a new chaotic pseudo-random number generator (PRNG) is proposed. It combines the well-known ISAAC and XORshift generators with chaotic iterations. This PRNG possesses important properties of topological chaos and can successfully pass NIST and TestU01 batteries of tests. This makes our generator suitable for information security applications like cryptography. As an illustrative ...

Pseudo-Random Number Generators (PRNGs) are required for generating secret keys in cryptographic algorithms, generating sequences of packet in Network simulations (workload generators) and other applications in various fields. In this paper we will discuss a list of some requirements for generating a reliable random sequence and then will present some PRNG methods which are based on combination...

In this paper, we propose a new chaotic map, Variational Logistic Map (VLM), modified from logistic map to be used in secure communication. Compared with classical logistic map, VLM has large parameter space without windows and can be implemented at low hardware cost. Referring to theBigCrush test suite in TestU01, VLM with disturbing method can significantly improve the output complexity as co...

A block cipher or a message authentication code(MAC ) should behave as random mapping which can be evaluated during statistical tests. Statistical test suites typically used for evaluation of random mapping are NIST, Diehard, Dieharder and TestU01 which are not well-suited for block ciphers and MAC s. These test suites employ frequentist approach;thus, making it difficult to overall evaluate th...