The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
True Random Number Generators
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
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
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
A 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
Monte Carlo simulations: Hidden errors from ‘‘good’’ random number generators
Ferrenberg, A. M., Landau, D. P., & Wong, Y. J. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.3382 · Cited by 437
A fast and compact quantum random number generator
Jennewein, T., Achleitner, U., Weihs, G., Weinfurter, H., & Zeilinger, A. (2000) · Review of Scientific Instruments · doi:10.1063/1.1150518 · Cited by 434 · cited 2×
“A mixture of beam splitter and temporal principle is described in [39].”
ResultUltrahigh-Speed Random Number Generation Based on a Chaotic Semiconductor Laser
Reidler, I., Aviad, Y., Rosenbluh, M., & Kanter, I. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.024102 · Cited by 424
A universal statistical test for random bit generators
Maurer, U. M. (1992) · Journal of Cryptology · doi:10.1007/bf00193563 · Cited by 263
New Methods for Digital Generation and Postprocessing of Random Data
Golic, J. D. J. (2006) · IEEE Transactions on Computers · doi:10.1109/tc.2006.164 · Cited by 188
High-Speed True Random Number Generation with Logic Gates Only
Dichtl, M., & Golić, J. D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2_4 · Cited by 182 · cited 3×
“They also conclude that randomness of neither of the two generator families by itself is not perfect and could be “enhanced” by XORing two independent generators, most favorably one GARO and one FIRO.”
Background
Cited by
Quantum random number generators
Herrero-Collantes, M., & Garcia-Escartin, J. C. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015004 · Cited by 791
Khan, K. S., Fawzy, M., & Chien, P. F. W. (2023) · International Journal of Gynecology & Obstetrics · doi:10.1002/ijgo.14837 · Cited by 20
Practical randomness amplification and privatisation with implementations on quantum computers
Foreman, C., Wright, S., Edgington, A., Berta, M., & Curchod, F. J. (2020) · arXiv · doi:10.48550/arxiv.2009.06551 · Cited by 1
Metadata
- Authors
- Stipčević, M., & Koç, Ç. K.
- Venue
- Open Problems in Mathematics and Computational Science
- Publisher
- Springer International Publishing
- Published
- 2014
- Pages
- 275-315
- OpenAlex
- W412116272
- Cited by
- 186
- References
- 12
- FWCI
- 21.96
- Type
- book chapter
- 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: True Random Number Generators. https://app.cochat.ai/papers/10.1007/978-3-319-10683-0_12
- The paper
- Stipčević, M., & Koç, Ç. K. (2014). True Random Number Generators. Open Problems in Mathematics and Computational Science. https://doi.org/10.1007/978-3-319-10683-0_12
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.