New Methods for Digital Generation and Postprocessing of Random Data
Abstract
A new method for digital true random number generation based on asynchronous logic circuits with feedback is introduced. In particular, a concrete technique using the so-called Galois and Fibonacci ring oscillators is developed and analyzed both theoretically and experimentally. The generated random binary sequences may have a very high speed and a higher and more robust entropy rate in comparison with previous proposals for digital random number generators. A new method for digital postprocessing of random data based on irregularly clocked nonautonomous synchronous logic circuits with feedback is also introduced and a concrete technique using a self-clock-controlled linear feedback shift register is proposed. The postprocessing can provide both randomness extraction and computationally secure speed increase of input random data
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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?
TRNGs using phase jitter extract entropy from edge-jitter of an oscillator and sample jitter events using a phase detector, including ring oscillators, coupled oscillators and Fibonacci/Galois ring oscillators.
“These TRNGs extract entropy from edge-jitter of oscillator and sample jitter events using phasedetector, including ring oscillators [7], coupled oscillators [2], [22], [23] and Fibonacci/Galois ring oscillators [24], [25].”
From True Random Number Generators Using Electrical Noise (2019) · cites this paper as [24]
FIRO and GARO are more sensitive to jitter than other oscillators, so jitter is quickly propagated and transformed through feedback, making them more suitable entropy sources.
“Compared to other oscillators, the number of inverters using FIRO and GARO is reduced and FIRO and GARO are more sensitive to jitter [24], [25].Thus, jitter is quickly propagated and transformed through feedback.Thus, FIRO and GARO are more suitable entropy source.”
From True Random Number Generators Using Electrical Noise (2019) · cites this paper as [24]
The citation lists haven’t been fetched yet
References 15 · Cited by 188
- Authors
- Golic, J. D. J.
- Affiliations
- Security Innovation, Telecom Italia, Turin, Italy
- Venue
- IEEE Transactions on Computers
- Published
- 2006-10
- Volume
- 55
- Issue
- 10
- Pages
- 1217-1229
- ISSN
- 0018-9340 (ISSN-L)
- 1557-9956
- 2326-3814
- OpenAlex
- W2132979456
- Cited by
- 188
- References
- 15
- Citations by year
- 2026: 3 · 2025: 12 · 2024: 10 · 2023: 12 · 2022: 10 · 2021: 9 · 2020: 7 · 2019: 16 · 2018: 6 · 2017: 10 · 2016: 18 · 2015: 11 · 2014: 17 · 2013: 10 · 2012: 7
- FWCI
- 10.25
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Computers (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Hardware and Architecture › Physical Unclonable Functions (PUFs) and Hardware Security
- Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Cellular Automata and Applications
- Keywords
- true random number generation, random binary sequences, entropy rate, randomness extraction, linear feedback shift registers
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
