Period Extension and Randomness Enhancement Using High-Throughput Reseeding-Mixing PRNG
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We present a new reseeding-mixing method to extend the system period length and to enhance the statistical properties of a chaos-based logistic map pseudo random number generator (PRNG). The reseeding method removes the short periods of the digitized logistic map and the mixing method extends the system period length to 2253by “xoring” with a DX generator. When implemented in the TSMC 0.18- μm 1P6M CMOS process, the new reseeding-mixing PRNG (RM-PRNG) attains the best throughput rate of 6.4 Gb/s compared with other nonlinear PRNGs. In addition, the generated random sequences pass the NIST SP 800-22 statistical tests including ratio test and U-value test.
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
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 · cited 2×
“Furthermore, good statistical qualities of the random numbers produced by our RM-PRNG are confirmed by SP800-22 tests [25].”
MethodA 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
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
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
Self-citationSine Chaotification Model for Enhancing Chaos and Its Hardware Implementation
Hua, Z., Zhou, B., & Zhou, Y. (2019) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2018.2833049 · Cited by 266
Sine-transform-based chaotic system with FPGA implementation
Hua, Z., Zhou, B., & Zhou, Y. (2018) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2017.2736515 · Cited by 180
Image encryption using finite-precision error
Nardo, L. G., Nepomuceno, E. G., Arias-Garcia, J., & Butusov, D. N. (2019) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2019.03.026 · Cited by 94
Metadata
- Authors
- Li, C.-Y., Chen, Y.-H., Chang, T.-Y., Deng, L.-Y., & To, K.
- Venue
- IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Published
- 2012-02
- Volume
- 20
- Issue
- 2
- Pages
- 385-389
- ISSN
- 1063-8210 (ISSN-L)
- 1557-9999
- OpenAlex
- W1976546042
- Cited by
- 96
- References
- 3
- FWCI
- 5.87
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Period Extension and Randomness Enhancement Using High-Throughput Reseeding-Mixing PRNG. https://app.cochat.ai/papers/10.1109/tvlsi.2010.2103332
- The paper
- Li, C.-Y., Chen, Y.-H., Chang, T.-Y., Deng, L.-Y., & To, K. (2012). Period Extension and Randomness Enhancement Using High-Throughput Reseeding-Mixing PRNG. IEEE Transactions on Very Large Scale Integration (VLSI) Systems. https://doi.org/10.1109/tvlsi.2010.2103332
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.