The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
True Random Bit Generation From a Double-Scroll Attractor
Abstract
In this paper, a novel true random bit generator (TRBG) based on a double-scroll attractor is proposed. The double-scroll attractor is obtained from a simple model which is qualitatively similar to Chua's circuit. In order to face the challenge of using the proposed TRBG in cryptography, the proposed TRBG is subjected to statistical tests which are the well-known Federal Information Processing Standards-140-1 and Diehard test suite in the area of cryptography. The proposed TRBG successfully passes all these tests and can be implemented in integrated circuits.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
An Introduction to Symbolic Dynamics and Coding
Lind, D., & Marcus, B. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108899727 · Cited by 2,696
The Art of Computer Programming
Worlton, W. J. (1968) · Nuclear Science and Engineering · doi:10.13182/nse68-a19548 · Cited by 2,251
Predicting chaotic time series
Farmer, J. D., & Sidorowich, J. J. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.845 · Cited by 1,929
Nonlinear prediction of chaotic time series
Casdagli, M. (1989) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(89)90074-2 · Cited by 1,341
Chua, L., Komuro, M., & Matsumoto, T. (1986) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1986.1085869 · Cited by 1,253
Chua's Circuit: A Paradigm for Chaos
Madan, R. N. (1993) · World Scientific Series on Nonlinear Science Series B · doi:10.1142/1997 · Cited by 602 · cited 1×
“Since then, the double-scroll attractor has been addressed by many researchers [28], [6].”
BackgroundA universal circuit for studying and generating chaos. I. Routes to chaos
Chua, L. O., Wu, C. W., Huang, A., & Zhong, G. (1993) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/81.246149 · Cited by 440
Kolumban, G., Kennedy, M. P., & Chua, L. O. (1998) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.735435 · Cited by 434
Predictability: a way to characterize complexity
Boffetta, G. (2002) · Physics Reports · doi:10.1016/s0370-1573(01)00025-4 · Cited by 391
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
Information and entropy in strange attractors
Fraser, A. M. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.32121 · Cited by 328
FAMILIES OF SCROLL GRID ATTRACTORS
YALÇIN, M. E., SUYKENS, J. A. K., VANDEWALLE, J., & ÖZOĞUZ, S. (2002) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127402004164 · Cited by 293
Self-citationStatistics of chaotic binary sequences
Kohda, T., & Tsuneda, A. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.567654 · Cited by 275
On the generation of cryptographically strong pseudorandom sequences
Shamir, A. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357353.357357 · Cited by 268
Elwakil, A. S., & Kennedy, M. P. (2001) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.915386 · Cited by 243
Randomness Recommendations for Security
Eastlake, D., Crocker, S., & Schiller, J. (1994) · doi:10.17487/rfc1750 · Cited by 176
Interval algorithm for random number generation
Han, T. S., & Hoshi, М. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.556116 · Cited by 141
A universal circuit for studying and generating chaos. II. Strange attractors
Chua, L. O., Wu, C. W., Huang, A., et al. (1993) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/81.246150 · Cited by 112
A Design of Reliable True Random Number Generator for Cryptographic Applications
Bagini, V., & Bucci, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48059-5_18 · Cited by 101
Detecting determinism in time series: the method of surrogate data
SMALL, M. P., & Tse, C. K. (2003) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/tcsi.2003.811020 · Cited by 88
Cryptographic Randomness from Air Turbulence in Disk Drives
Davis, D., Ihaka, R., & Fenstermacher, P. R. (2007) · Springer eBooks · doi:10.1007/3-540-48658-5_13 · Cited by 85
Spectral properties of chaos-based FM signals: theory and simulation results
Callegari, S., Rovatti, R., & Setti, G. (2003) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/tcsi.2002.807510 · Cited by 83
An LSI Random Number Generator (RNG)
Fairfield, R. C., Mortenson, R. L., & Coulthart, K. B. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_18 · Cited by 78
How to turn loaded dice into fair coins
Juels, A., Jakobsson, M., Shriver, E., & Hillyer, B. K. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841170 · Cited by 63
MOS realization of the double-scroll-like chaotic equation
Radwan, A. G., Soliman, A. M., & El-Sedeek, A.-L. (2003) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/tcsi.2002.808217 · Cited by 55
AN EQUATION FOR GENERATING CHAOS AND ITS MONOLITHIC IMPLEMENTATION
Elwakil, A. S., Salama, K. N., & Kennedy, M. P. (2002) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127402006205 · Cited by 44
Concept for a High Performance Random Number Generator Based on Physical Random Phenomena
Gude, M. T. (1985) · Frequenz · doi:10.1515/freq.1985.39.7-8.187 · Cited by 42
A practical secure physical random bit generator
Jakobsson, M., Shriver, E., Hillyer, B. K., & Juels, A. (1998) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/288090.288114 · Cited by 36
González, J. A., Reyes, L., Suárez, J. J., Guerrero, L. E., & Gutiérrez, G. (2002) · Physics Letters A · doi:10.1016/s0375-9601(02)00101-9 · Cited by 26
The K.U.Leuven Time Series Prediction Competition
Suykens, J. A. K., & Vandewalle, J. P. L. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5703-6_9 · Cited by 21
Self-citationRandom Number Generators Founded on Signal and Information Theory
Maher, D. P., & Rance, R. J. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48059-5_19 · Cited by 9
Cited by
A fast image encryption system based on chaotic maps with finite precision representation
Kwok, H. S., & Tang, W. K. S. (2007) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2005.11.090 · Cited by 428
A novel design method for discrete time chaos based true random number generators
Cicek, I., Pusane, A. E., & Dundar, G. (2014) · Integration · doi:10.1016/j.vlsi.2013.06.003 · Cited by 101
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
“However, analog circuit blocks is needed for continuous time chaosbased TRNGs, such as operational amplifier (OPAMP) [82], [83], whichmakes continuous time chaos-based TRNGs have large area and high consumption.”
BackgroundA High Speed IC Truly Random Number Generator Based on Chaotic Sampling of Regular Waveform
ERGÜN, S., GÜLER, Ü., & ASADA, K. (2011) · IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences · doi:10.1587/transfun.e94.a.180 · Cited by 53
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
- Yalcin, M. E., Suykens, J. A. K., & Vandewalle, J.
- Venue
- IEEE Transactions on Circuits and Systems I: Regular Papers
- Published
- 2004-07
- Volume
- 51
- Issue
- 7
- Pages
- 1395-1404
- ISSN
- 1057-7122 (ISSN-L)
- OpenAlex
- W2138990845
- Cited by
- 280
- References
- 33
- FWCI
- 13.93
- 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.