Design and Test of an Integrated Random Number Generator with All-Digital Entropy Source.

Entropy (Basel)

Department of Information Engineering, University of Pisa, Via G. Caruso, 16, 56122 Pisa, Italy.

Published: January 2022

In the cybersecurity field, the generation of random numbers is extremely important because they are employed in different applications such as the generation/derivation of cryptographic keys, nonces, and initialization vectors. The more unpredictable the random sequence, the higher its quality and the lower the probability of recovering the value of those random numbers for an adversary. Cryptographically Secure Pseudo-Random Number Generators (CSPRNGs) are random number generators (RNGs) with specific properties and whose output sequence has such a degree of randomness that it cannot be distinguished from an ideal random sequence. In this work, we designed an all-digital RNG, which includes a Deterministic Random Bit Generator (DRBG) that meets the security requirements for cryptographic applications as CSPRNG, plus an entropy source that showed high portability and a high level of entropy. The proposed design has been intensively tested against both NIST and BSI suites to assess its entropy and randomness, and it is ready to be integrated into the European Processor Initiative (EPI) chip.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC8871157PMC
http://dx.doi.org/10.3390/e24020139DOI Listing

Publication Analysis

Top Keywords

random number
8
entropy source
8
random numbers
8
random sequence
8
number generators
8
random
7
design test
4
test integrated
4
integrated random
4
number generator
4

Similar Publications

Objective: Many patients with ruptured intracranial aneurysms (RIAs) underrepresented or excluded from previous randomized controlled trials (RCTs) comparing surgery with endovascular treatment (EVT) are still considered for surgical clipping, but the best management of these patients remains unknown.

Methods: The International Subarachnoid Aneurysm Trial-2 was a randomized trial comparing surgical versus EVT of RIAs considered for surgical clipping, despite the results of previous RCTs, and also eligible for EVT. The primary endpoint was death or dependency according to the modified Rankin Scale score (mRS score > 2) at 1 year.

View Article and Find Full Text PDF

Background: Posttraumatic stress disorder (PTSD) affects 3.9% of the general population. While massed cognitive processing therapy (CPT) has demonstrated efficacy in treating chronic PTSD, a substantial proportion of patients still continue to meet PTSD criteria after treatment, highlighting the need for novel therapeutic approaches.

View Article and Find Full Text PDF

Background: Pregnancy is often seen as a joyful and fulfilling time for many women. However, a significant number of women in Ethiopia experience intimate partner violence (IPV) during this period. Despite this, there is limited evidence on interventions aimed at preventing violence during pregnancy.

View Article and Find Full Text PDF

The Cost of Randomness in Evolutionary Algorithms: Crossover Can Save Random Bits.

Evol Comput

January 2025

Chair of Algorithms for Intelligent Systems, University of Passau, Passau, Germany

Evolutionary algorithms make countless random decisions during selection, mutation and crossover operations. These random decisions require a steady stream of random numbers. We analyze the expected number of random bits used throughout a run of an evolutionary algorithm and refer to this as the cost of randomness.

View Article and Find Full Text PDF

Purpose: Patients with stage I colorectal cancer (CRC) rarely experience recurrence after curative resection. Therefore, the risk factors for stage I CRC recurrence are yet to be established. We aimed to identify risk factors for stage I CRC recurrence.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!