Fully Digital Redundant Random Number Generator in CMOS Technology
Antonio J. Acosta, M.J. Bellido, M. Valencia, A. Barriga, J.L. Huertas
Abstract
Antonio J. Acosta, M.J. Bellido, M. Valencia, A. Barriga, J.L. Huertas
Abstract
This communication presents a new fully-digital redundant Random Number Generator. Its structure is that of a standard LFSR, with the difference that it includes one 1-bit ros-RNG in each basic cell. The design is modular, provides reasonable performances - simplicity, low cost and high speed -, it generates truly random sequences (i.e. aperiodic and unpredictable) and allows choosing random or pseudorandom sequences. Working like a truly random generator, the circuit produces random sequences from the first clock cycle, i.e., user must not wait a latency time to obtain a good sequence.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This communication presents a new fully-digital redundant Random Number Generator. Its structure is that of a standard LFSR, with the difference that it includes one 1-bit ros-RNG in each basic cell. The design is modular, provides reasonable performances - simplicity, low cost and high speed -, it generates truly random sequences (i.e. aperiodic and unpredictable) and allows choosing random or pseudorandom sequences. Working like a truly random generator, the circuit produces random sequences from the first clock cycle, i.e., user must not wait a latency time to obtain a good sequence.
Key concepts: Pseudorandom number generator, Self-shrinking generator, Random number generation, Random seed, Computer science, Aperiodic graph, Generator (circuit theory), Modular design