Physical Unclonable Function (PUF) Based Random Number Generator
Ali Sadr, Mostafa Zolfaghari-Nejad

TL;DR
This paper introduces a novel PUF-based true random number generator that leverages an Arbiter PUF within an NFSR, achieving high-speed output, passing NIST tests, and using minimal resources for lightweight applications.
Contribution
It presents a new PUF-based RNG architecture using an Arbiter PUF in an NFSR, with high output rate and low resource consumption.
Findings
Produces 10 million bits per second
Passes all NIST randomness tests
Uses only 193 slices, suitable for lightweight devices
Abstract
Physical Unclonable Functions (PUFs) are widely used to generate random Numbers. In this paper we propose a new architecture in which an Arbiter Based PUF has been employed as a nonlinear function in Nonlinear Feedback Shift Register (NFSR) to generate true random numbers. The rate of producing the output bit streams is 10 million bits per second. The proposed RNG is able to pass all NIST tests and the entropy of the output stream is 7.999837 bits per byte. The proposed circuit has very low resource usage of 193 Slices that makes it suitable for lightweight applications.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPhysical Unclonable Functions (PUFs) and Hardware Security · Cell Image Analysis Techniques · Integrated Circuits and Semiconductor Failure Analysis
