The DOI matches its Crossref record.
FPGA-Based True Random Number Generation Using Circuit Metastability with Adaptive Feedback Control
Open accessOverview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Metastability is a perfect solution for TRNGs due to easy integration and energy efficiency, but metastability events are very sensitive to PVT changes, making it hard to keep a bi-stable circuit in an unstable state.
“Due to its easy integration and energy-efficient in circuits [55], metastability is a perfect solution for TRNGs.However, metastability events are very sensitive to manufacturing process and voltage and temperature (PVT) changes.Hence, it is hard to keep a bi-stable circuit in an unstable state [65], [66].”
From True Random Number Generators Using Electrical Noise (2019) · cites this paper as [66]
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 14
- Barak, B., Shaltiel, R., Tromer, E.: True random number generators secure in a changing environment. In: Walter, C.D., Koç, Ç.K., Paar, C. (eds.) CHES 2003. LNCS, vol. 2779, pp. 166–180. Springer, Heidelberg (2003) · DOI
- Bergeron, E., Feeley, M., Daigneault, M.A., David, J.: Using dynamic reconfiguration to implement high-resolution programmable delays on an FPGA. In: NEWCAS-TAISA, pp. 265–268 (2008) · DOI
- Gassend, B., Clarke, D., van Dijk, M., Devadas, S.: Silicon physical random functions. In: CCS, pp. 148–160 (2002) · DOI
- Lee, J., Lim, D., Gassend, B., Suh, G., van Dijk, M., Devadas, S.: A technique to build a secret key in integrated circuits for identification and authentication applications. In: Symposium on VLSI Circuits, pp. 176–179 (2004)
- Majzoobi, M., Dyer, E., Elnably, A., Koushanfar, F.: Rapid FPGA characterization using clock synthesis and signal sparsity. In: International Test Conference, ITC (2010) · DOI
- Majzoobi, M., Koushanfar, F.: FPGA time-bounded authentication. IEEE Transactions on Information Forensics and Security PP(99), 1 (2011)
- Majzoobi, M., Koushanfar, F., Devadas, S.: FPGA PUF using programmable delay lines. In: IEEE Workshop on Information Forensics and Security (WIFS), pp. 1–6 (2010) · DOI
- Majzoobi, M., Elnably, A., Koushanfar, F.: FPGA time-bounded unclonable authentication. In: Böhme, R., Fong, P.W.L., Safavi-Naini, R. (eds.) IH 2010. LNCS, vol. 6387, pp. 1–16. Springer, Heidelberg (2010) · DOI
- von Neumann, J.: Various techniques used in connection with random digits. von Neumann Collected Works 5, 768–770 (1963)
- Schellekens, D., Preneel, B., Verbauwhede, I.: FPGA vendor agnostic true random number generator. In: Field Programmable Logic and Applications (FPL), pp. 1–6 (2006) · DOI
- Suh, G., Devadas, S.: Physical unclonable functions for device authentication and secret key generation. In: Design Automation Conference (DAC), p. 914 (2007) · DOI
- Sunar, B.: True Random Number Generators for Cryptography. In: Cryptographic Engineering. Springer, Heidelberg (2009)
- Sunar, B., Martin, W.J., Stinson, D.R.: A provably secure true random number generator with built-in tolerance to active attacks. IEEE Transactions on Computers 58, 109–119 (2007) · DOI · Paper page
- Wong, J.S.J., Sedcole, P., Cheung, P.Y.K.: Self-Measurement of Combinatorial Circuit Delays in FPGAs. ACM Transactions on Reconfigurable Technology and Systems 2(2), 1–22 (2009) · DOI
Cited by
Sorted by citations
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
“Hence, it is hard to keep a bi-stable circuit in an unstable state [65], [66].”
BackgroundWieczorek, P. Z., & Golofit, K. (2018) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2017.2751144 · Cited by 53
Robust, 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
Lightweight TRNG Based on Multiphase Timing of Bistables
Wieczorek, P. Z. (2016) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2016.2555248 · Cited by 27
Metadata
- Authors
- Majzoobi, M., Koushanfar, F., & Devadas, S.
- Affiliations
- Rice University (US)
- Massachusetts Institute of Technology (US)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 17-32
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1717406790
- Cited by
- 155
- References
- 0
- Citations by year
- 2026: 4 · 2025: 12 · 2024: 10 · 2023: 9 · 2022: 10 · 2021: 15 · 2020: 18 · 2019: 13 · 2018: 10 · 2017: 13 · 2016: 9 · 2015: 5 · 2014: 12 · 2013: 6 · 2012: 9
- FWCI
- 5.57
- Type
- conference paper
- Language
- en
- Open access
- green
- hdl.handle.net
- Licence
- cc-by-nc-sa
- Locations
- Lecture notes in computer science (publishedVersion)
- DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc-sa)
- Topics
- Physical Sciences › Computer Science › Hardware and Architecture › Physical Unclonable Functions (PUFs) and Hardware Security
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Radiation Effects in Electronics
- Keywords
- true random number generation, FPGA, flip-flops, programmable delay line, adaptive feedback control, bias monitoring, NIST randomness tests, hardware security, adversarial attacks
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
