A feedback strategy to improve the entropy of a chaos-based random bit generator
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
In this paper, the guidelines to design a true random bit generator (TRBG) circuit with a predefined minimum entropy are discussed. The approach is proposed for a TRBG based on a one-dimensional piecewise-linear chaotic map; it does not require bit throughput reduction, and it is suitable for the development of integrated TRBG circuits. In particular, the proposed design strategy is based on a feedback control procedure that allows to dynamically change the system parameters for the correction of the circuit "nonidealities" (e.g., the circuit offsets). The correction algorithm does not require a direct measurement of the system "nonidealities" or of the effective value of the map parameters, but only a dynamic estimation of these quantities based on the observation of the TRBG output. The design approach is validated by a hardware prototype implemented on a field-programmable analog array. The results of the NIST FIPS 140-2 test suite, the DIEHARD test suite, and the Coron's Universal test, applied to the TRBG output sequences before and after a simple post processing without throughput reduction, are reported and discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Chaos: An Introduction to Dynamical Systems
Alligood, K. T., Sauer, T. D., Yorke, J. A., & Crawford, J. D. (1997) · Physics Today · doi:10.1063/1.882006 · Cited by 1,469
Lasota, A., & Mackey, M. C. (1994) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-4286-4 · Cited by 1,353
Chaos-based random number generators-part I: analysis [cryptography]
Stojanovski, T., & Kocarev, L. (2001) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.915385 · Cited by 371
Chaos-based random number generators. Part II: practical realization
Stojanovski, T., Pihl, J., & Kocarev, L. (2001) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.915396 · Cited by 279
A universal statistical test for random bit generators
Maurer, U. M. (1992) · Journal of Cryptology · doi:10.1007/bf00193563 · Cited by 263
Modeling and simulation of oscillator-based random number generators
Petrie, C. S., & Connelly, J. A. (1996) · 1996 IEEE International Symposium on Circuits and Systems (ISCAS) · doi:10.1109/iscas.1996.541967 · Cited by 62 · cited 1×
“plification of electronic noise [7], [8], the sampling of unstable free-running oscillators [9], [ 10 ], and the use of chaotic dynamical systems [6], [11]–[14].”
Background
Cited by
Dynamic Analysis of Digital Chaotic Maps via State-Mapping Networks
Li, C., Feng, B., Li, S., Kurths, J., & Chen, G. (2019) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2018.2888688 · Cited by 270
A 82-nW Chaotic Map True Random Number Generator Based on a Sub-Ranging SAR ADC
Kim, M., Ha, U., Lee, K. J., Lee, Y., & Yoo, H.-J. (2017) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2017.2694833 · Cited by 97
True Random Number Generators Using Electrical Noise
Gong, L., Zhang, J., Liu, H., Sang, L., & Wang, Y. (2019) · IEEE Access · doi:10.1109/access.2019.2939027 · Cited by 77
“noise on the metastable behavior [9]–[12] and amplify noise based on chaos circuits [1], [13], [14].”
BackgroundWieczorek, P. Z., & Golofit, K. (2018) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2017.2751144 · Cited by 53
“, Monte Carlo methods) [1].”
True Random Number Generation Via Sampling From Flat Band-Limited Gaussian Processes
Gov, N. C., Mihcak, M. K., & Ergun, S. (2011) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2010.2089561 · Cited by 48
Metadata
- Authors
- Addabbo, T., Alioto, M., Fort, A., Rocchi, S., & Vignoli, V.
- Venue
- IEEE Transactions on Circuits and Systems I: Regular Papers
- Published
- 2006-02
- Volume
- 53
- Issue
- 2
- Pages
- 326-337
- ISSN
- 1057-7122 (ISSN-L)
- OpenAlex
- W2124006010
- Cited by
- 96
- References
- 7
- FWCI
- 6.67
- Type
- journal article
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.