Implementation and Testing of High-Speed CMOS True Random Number Generators Based on Chaotic Systems
The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
We present the design and the validation by means of suitably improved randomness tests of two different implementations of high-performance true-random number generators which use a discrete-time chaotic circuit as their entropy source. The proposed system has been developed from a standard pipeline Analog-to-Digital converter (ADC) design, modified to operate as a set of piecewise-linear chaotic maps. The evolution of each map is observed and quantized to obtain a random bit stream. With this approach it is possible to obtain, on current CMOS technology, a data rate in the order of tens of megabit per second. Furthermore, we can also prove that the design is tamper resistant in the sense that a power analysis cannot leak information regarding the generated bits. This makes the proposed circuit perfectly suitable for embedding in cryptographic systems like smarts cards, even more so if one consider that it could be easily obtained by reconfiguring an existing pipeline ADC. The two prototypes have been designed in a 0.35-μm and 0.18-μm CMOS technology, and have a throughput of, respectively, 40 Mbit/s and 100 Mbit/s. A comparison between measured results and other high-end commercial solutions shows a comparable quality with a operating speed that is one order of magnitude faster.
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
Bassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617
Daemen, J., & Rijmen, V. (2002) · Information Security and Cryptography · doi:10.1007/978-3-662-04722-4 · Cited by 2,437
Lasota, A., & Mackey, M. C. (1994) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-4286-4 · Cited by 1,353 · cited 3×
“The RNGs we discuss in this paper belong to this class, being based on a discrete-time chaotic circuit [7], [21], [22].”
BackgroundA Simple Unpredictable Pseudo-Random Number Generator
Blum, L., Blum, M., & Shub, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215025 · Cited by 1,036
TestU01: A C library for empirical testing of random number generators
L'Ecuyer, P., & Simard, R. (2007) · ACM Transactions on Mathematical Software · doi:10.1145/1268776.1268777 · Cited by 1,014 · cited 1×
“The suite by L’Ecuyer [46] has been recently published.”
BackgroundA Provably Secure True Random Number Generator with Built-In Tolerance to Active Attacks
Sunar, B., Martin, W. J., & Stinson, D. R. (2007) · IEEE Transactions on Computers · doi:10.1109/tc.2007.250627 · Cited by 673
Bucci, M., Germani, L., Luzzi, R., Trifiletti, A., & Varanonuovo, M. (2003) · IEEE Transactions on Computers · doi:10.1109/tc.2003.1190581 · Cited by 403
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
Cited by
Wireless Chaos-Based Communication Systems: A Comprehensive Survey
Kaddoum, G. (2016) · IEEE Access · doi:10.1109/access.2016.2572730 · Cited by 349
Secure image encryption algorithm design using a novel chaos based S-box
Çavuşoğlu, Ü., Kaçar, S., Pehlivan, I., & Zengin, A. (2017) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2016.12.018 · Cited by 291
Pareschi, F., Rovatti, R., & Setti, G. (2012) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2012.2185227 · Cited by 189
Self-citationMathew, S. K., Johnston, D., Satpathy, S., Suresh, V., Newman, P., Anders, M. A., Kaul, H., Agarwal, A., Hsu, S. K., Chen, G., et al. (2016) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2016.2558490 · Cited by 102
“XOR-based extractors [8], [30], [31] are very effective at reducing bias b present in a random bitstream, with ‘0’ and ‘1’ probabilities of 0.”
BackgroundMethodA 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
Metadata
- Authors
- Pareschi, F., Setti, G., & Rovatti, R.
- Venue
- IEEE Transactions on Circuits and Systems I: Regular Papers
- Published
- 2010-12
- Volume
- 57
- Issue
- 12
- Pages
- 3124-3137
- ISSN
- 1549-8328 (ISSN-L)
- 1558-0806
- OpenAlex
- W2139280266
- Cited by
- 147
- References
- 17
- FWCI
- 5.52
- 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.