Secure random number generation using chaotic circuits
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
The authors suggest a class of circuits for generating secure pseudo-random numbers and estimate the security of these generators from the information loss property of chaotic systems. For a generator implemented using a chaotic DPLL (digital phase-locked loop), two important cases are considered: (1) given no prior information concerning the initial conditions of a continuously running circuit, the length of time one should wait after taking a bit before one can securely take another bit is established; and (2) given knowledge of the initial conditions at startup (up to measurement and noise uncertainty), the length of time one should wait before starting the bit sampling is shown.>
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Determining Lyapunov exponents from a time series
Wolf, A., Swift, J. B., Swinney, H. L., & Vastano, J. A. (1985) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(85)90011-9 · Cited by 9,499
Cited by
A noise-based IC random number generator for applications in cryptography
Petrie, C. S., & Connelly, J. A. (2000) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.847868 · Cited by 487
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
Callegari, S., Rovatti, R., & Setti, G. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.839924 · Cited by 243
Shujun, L., Xuanqin, M., & Yuanlong, C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45311-3_30 · Cited by 232
Fast physical random number generator using amplified spontaneous emission
Williams, C. R. S., Salevan, J. C., Li, X., Roy, R., & Murphy, T. E. (2010) · Optics Express · doi:10.1364/oe.18.023584 · Cited by 229
Drutarovsky, M., & Galajda, P. (2007) · 2007 17th International Conference Radioelektronika · doi:10.1109/radioelek.2007.371423 · Cited by 77
Metadata
- Authors
- Bernstein, G. M., & Lieberman, M. A.
- Venue
- IEEE Transactions on Circuits and Systems
- Published
- 1990
- Volume
- 37
- Issue
- 9
- Pages
- 1157-1164
- ISSN
- 0098-4094 (ISSN-L)
- OpenAlex
- W2028638702
- Cited by
- 124
- References
- 2
- FWCI
- 2.40
- 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.