Cited by 21Physical Unclonable Functions (PUFs) and Hardware SecurityAdvancements in PLL and VCO TechnologiesQuantum Information and Cryptography

Theory and implementation of a very high throughput true random number generator in field programmable gate array

Wang, Yonggang, Hui, Cong, Liu, Chong, Xu, Chao·2016·Review of Scientific Instruments

Abstract

The contribution of this paper is proposing a new entropy extraction mechanism based on sampling phase jitter in ring oscillators to make a high throughput true random number generator in a field programmable gate array (FPGA) practical. Starting from experimental observation and analysis of the entropy source in FPGA, a multi-phase sampling method is exploited to harvest the clock jitter with a maximum entropy and fast sampling speed. This parametrized design is implemented in a Xilinx Artix-7 FPGA, where the carry chains in the FPGA are explored to realize the precise phase shifting. The generator circuit is simple and resource-saving, so that multiple generation channels can run in parallel to scale the output throughput for specific applications. The prototype integrates 64 circuit units in the FPGA to provide a total output throughput of 7.68 Gbps, which meets the requirement of current high-speed quantum key distribution systems. The randomness evaluation, as well as its robustness to ambient temperature, confirms that the new method in a purely digital fashion can provide high-speed high-quality random bit sequences for a variety of embedded applications.

Integrity signals

Registry

Crossref · 10.1063/1.4945564

Cites

16 of 16 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Post-processing can increase the probability of bits passing randomness tests while reducing throughput.

    “Usually, using postprocessing can increase that the probability of bits passing the test, while their throughput will be reduced [86].”

    From True Random Number Generators Using Electrical Noise (2019) · cites this paper as [86]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Wang, Y., Hui, C., Liu, C., & Xu, C.
Affiliations
University of Science and Technology of China (CN)
Venue
Review of Scientific Instruments
Published
2016-04-01
Volume
87
Issue
4
Pages
044704-044704
ISSN
  • 0034-6748 (ISSN-L)
  • 1089-7623
OpenAlex
W2340448478
Cited by
21
References
16
Citations by year
2026: 1 · 2025: 4 · 2024: 2 · 2023: 2 · 2022: 1 · 2021: 3 · 2020: 3 · 2019: 4 · 2018: 1
FWCI
2.53
Type
journal article
Language
en
Open access
closed
Locations
  • Review of Scientific Instruments (publishedVersion)
  • PubMed (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Hardware and Architecture › Physical Unclonable Functions (PUFs) and Hardware Security
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advancements in PLL and VCO Technologies
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
Keywords
true random number generator, FPGA, ring oscillator, clock jitter, entropy extraction, high throughput, quantum key distribution, randomness testing, temperature robustness

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review