Conference paper Open Access

Upper Bounds on The Min-Entropy of RO Sum, Arbiter, Feed-Forward Arbiter, and S-ArbRO PUFs

Jeroen Delvaux; Dawu Gu; Ingrid Verbauwhede

The focus and novelty of this work is the derivation of tight upper bounds on the min-entropy of several physically unclonable funcions (PUFs), i.e., Ring Oscillator Sum, Arbiter, Feed-Forward Arbiter, and S-ArbRO PUFs. This constrains their usability for the fuzzy extraction of a secret key, as an alternative to storing keys in non-volatile memory. For example, it is shown that an ideal Arbiter PUF with 64 stages cannot provide more than 197 bits of min-entropy. At Financial Cryptography 2012, Van Herrewege et al. assume that 1785 bits of min-entropy can be extracted, which renders their 128-bit key generator instantly insecure. We also derive upper bounds that comply with nonideal PUFs, attributed to, e.g., manufacturing in silicon. As a side contribution hereby, we refute the claim that S-ArbRO PUFs are highly resistant against machine learning.

Files (423.0 kB)
Name Size
AsianHOST-UpperboundsMinEntropy-KUL.pdf
md5:301a3a17dcf57dc6edb3e1ecdd908520
423.0 kB Download
4
2
views
downloads
All versions This version
Views 44
Downloads 22
Data volume 845.9 kB845.9 kB
Unique views 44
Unique downloads 22

Share

Cite as