查看文章

For cryptographic applications based on physical unclonable functions (PUFs), it is very important to estimate the entropy of PUF responses accurately. The upper bound of the entropy estimated by compression algorithms, such as context-tree weighting, is too loose, while the lower bound estimated by the min-entropy calculation is too conservative, especially when the sample size is small. The actual min-entropy is between these bounds but is difficult to estimate accurately. In this paper, two models are proposed to estimate the convergence of the inter-chip min-entropy of static random-access memory (SRAM) PUFs. The basic idea is to find the relation between the expectation of the estimation result and the tested sample size, and then predict the convergence of the min-entropy. Furthermore, an improved Von Neumann extractor is used to increase the entropy per bit while retaining as many responses as …