Embeddable ADC-based true random number generator for cryptographic applications exploiting nonlinear signal processing and chaos
Abstract
We present a true random number generator which, contrary to other implementations, is not based on the explicit observation of complex micro-cosmic processes but on standard signal processing primitives, freeing the designer from the need for dedicated hardware. The system can be implemented from now ubiquitous analog-to-digital converters building blocks, and is therefore well-suited to embedding. On current technologies, the design permits data rates in the order of a few tens of megabits per second. Furthermore, the absence of predictable, repeatable behaviors increases the system security for cryptographic applications. The design relies on a simple inner model based on chaotic dynamics which, in ideal conditions, can be formally proven to generate perfectly uncorrelated binary sequences. Here, we detail the design and we validate the quality of its output against a couple of test suites standardized by the U.S. National Institute of Standards and Technology, both in the ideal case and assuming implementation errors.
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?
As the number of bits decreases, the randomness tends to improve.
“As the number of bits decreases, the randomness tends to improve (44, 45).”
From Cryptographic transistor for true random number generator with low power consumption (2024) · cites this paper as [45]
The citation lists haven’t been fetched yet
References 24 · Cited by 243
- Authors
- Callegari, S., Rovatti, R., & Setti, G.
- Affiliations
- University of Bologna (IT)
- University of Ferrara (IT)
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2005-02
- Volume
- 53
- Issue
- 2
- Pages
- 793-805
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W4254369800
- Cited by
- 243
- References
- 24
- Citations by year
- 2026: 4 · 2025: 4 · 2024: 4 · 2023: 3 · 2022: 14 · 2021: 12 · 2020: 15 · 2019: 12 · 2018: 16 · 2017: 18 · 2016: 13 · 2015: 17 · 2014: 12 · 2013: 11 · 2012: 5
- FWCI
- 16.28
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Signal Processing (publishedVersion)
- Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna) (submittedVersion)
- PORTO@Iris (submittedVersion)
- PORTO Publications Open Repository TOrino (Politecnico di Torino) (submittedVersion)
- Institutional Research Information System University of Ferrara (University of Ferrara) (submittedVersion)
- IEEE Transactions on Signal Processing
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Computer Science › Hardware and Architecture › Physical Unclonable Functions (PUFs) and Hardware Security
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Chaos control and synchronization
- Keywords
- true random number generator, chaotic dynamics, analog-to-digital converter, nonlinear signal processing, cryptographic randomness, embedded hardware, implementation errors, hardware security
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