A Fast Chaos-based True Random Number Generator for Cryptographic Applications
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We present the design and the validation by means of state-of-the-art randomness tests of a high-quality true random number generator which internally exploits a pipeline analog-to-digital converter modified to operate as a set of interleaved chaotic maps. Developing the circuit design relying on pipeline A/D technology, which is ubiquity used in all mixed signal systems, allow us to design a fast and very reliable TRNG. A prototype has been implemented in AMS 0.35 mum 2P3M technology and has a nominal throughput of 40 Mbits per second. The active area occupied by the chip is about 0.52 mm2and the power consumption is less than 30 mW
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
Callegari, S., Rovatti, R., & Setti, G. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.839924 · Cited by 243
Self-citation
Cited by
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
“…unlike their CT counterparts, DT chaotic TRNGs do not need any large area occupying components such as inductors used in cross coupled chaotic oscillators [12], rendering themselves more compatible with the standard digital CMOS processes in which cryptographic circuits are fabricated [15].”
A 3 $\mu$W CMOS True Random Number Generator With Adaptive Floating-Gate Offset Cancellation
Holleman, J., Bridges, S., Otis, B. P., & Diorio, C. (2008) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2008.920327 · Cited by 63
Second-level NIST Randomness Tests for Improving Test Reliability
Pareschi, F., Rovatti, R., & Setti, G. (2007) · 2007 IEEE International Symposium on Circuits and Systems (ISCAS) · doi:10.1109/iscas.2007.378572 · Cited by 45
Self-citation
Metadata
- Authors
- Pareschi, F., Setti, G., & Rovatti, R.
- Venue
- 2006 Proceedings of the 32nd European Solid-State Circuits Conference
- Publisher
- IEEE
- Published
- 2006-09
- Pages
- 130-133
- ISSN
- 1930-8833 (ISSN-L)
- OpenAlex
- W2170141950
- Cited by
- 75
- References
- 3
- FWCI
- 3.11
- Type
- conference paper
- Language
- en
- Open access
- green
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.