FPGA Vendor Agnostic True Random Number Generator
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
This paper describes a solution for the generation of true random numbers in a purely digital fashion; making it suitable for any FPGA type, because no FPGA vendor specific features (e.g., like phase-locked loop) or external analog components are required. Our solution is based on a framework for a provable secure true random number generator recently proposed by Sunar, Martin and Stinson. It uses a large amount of ring oscillators with identical ring lengths as a fast noise source - but with some deterministic bits - and eliminates the non-random samples by appropriate post-processing based on resilient functions. This results in a slower bit stream with high entropy. Our FPGA implementation achieves a random bit throughput of more than 2 Mbps, remains fairly compact (needing minimally 110 ring oscillators of 3 inverters) and is highly portable
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 · cited 1×
“The design parameters of most proposals (such as sampling frequency, amount of post-processing, and thus the resulting bitstream throughput) are mainly determined by trial and error until the random bitstream passes the statistical tests provided by the NIST [ 10 ] or DIEHARD [11] test suite.”
MethodRukhin, A., Sota, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., et al. (2000) · doi:10.6028/nist.sp.800-22 · Cited by 1,867
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
Cited by
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
Mathew, S. K., Srinivasan, S., Anders, M. A., Kaul, H., Hsu, S. K., Sheikh, F., Agarwal, A., Satpathy, S., & Krishnamurthy, R. K. (2012) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2012.2217631 · Cited by 195
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
“The statistical results [13] for this design may be caused by pseudo random behavior and, hence, do not allow one to judge the amount of entropy produced.”
BackgroundMethodResultInfluentialAnalysis and Enhancement of Random Number Generator in FPGA Based on Oscillator Rings
Wold, K., & Tan, C. H. (2009) · International Journal of Reconfigurable Computing · doi:10.1155/2009/501672 · Cited by 168
FPGA-Based True Random Number Generation Using Circuit Metastability with Adaptive Feedback Control
Majzoobi, M., Koushanfar, F., & Devadas, S. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23951-9_2 · Cited by 155
FPGA Implementation of Metastability-Based True Random Number Generator
HATA, H., & ICHIKAWA, S. (2012) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.e95.d.426 · Cited by 115
“To compare our TRNG and a Sunar-type TRNG with the same technology, we implemented and evaluated a Sunartype TRNG that was presented by Schellekens et al. [9] This design is designated as Ring Osc 110, since it includes 110 ROs consisting of 3 inverters.”
BackgroundMethodResultInfluentialMathew, 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
A novel chaos-based post-processing for TRNG
Avaroğlu, E., Tuncer, T., Özer, A. B., Ergen, B., & Türk, M. (2015) · Nonlinear Dynamics · doi:10.1007/s11071-015-1981-9 · Cited by 61
A Comparison of Post-Processing Techniques for Biased Random Number Generators
Kwok, S.-H., Ee, Y.-L., Chew, G., Zheng, K., Khoo, K., & Tan, C.-H. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-21040-2_12 · Cited by 57
“2 [10].”
A digital IC Random Number Generator with logic gates only
Guler, U., Ergun, S., & Dundar, G. (2010) · 2010 17th IEEE International Conference on Electronics, Circuits and Systems · doi:10.1109/icecs.2010.5724498 · Cited by 34
“This throughput rate is 62.5 times higher than the previous design results shown in [6] and [ 18 ], additionally, no post-processing stage is required.”
ResultInfluentialRobust, low-cost, auditable random number generation for embedded system security
Lampert, B., Wahby, R. S., Leonard, S., & Levis, P. (2016) · Proceedings of the 14th ACM Conference on Embedded Networked Sensor Systems CD-ROM · doi:10.1145/2994551.2994568 · Cited by 27
Wang, Y., Hui, C., Liu, C., & Xu, C. (2016) · Review of Scientific Instruments · doi:10.1063/1.4945564 · Cited by 21
Guler, U., Pusane, A. E., & Dundar, G. (2014) · 2014 International Conference on Information Science, Electronics and Electrical Engineering · doi:10.1109/infoseee.2014.6947786 · Cited by 9
“After some time from the publication of [1], researchers started to implement RO based TRNGs [2]–[4].”
Background
Metadata
- Authors
- Schellekens, D., Preneel, B., & Verbauwhede, I.
- Venue
- 2006 International Conference on Field Programmable Logic and Applications
- Publisher
- IEEE
- Published
- 2006-08
- Pages
- 1-6
- OpenAlex
- W2033711887
- Cited by
- 140
- References
- 4
- FWCI
- 5.69
- Type
- conference paper
- 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.