Challenge codes for physically unclonable functions with Gaussian delays: A maximum entropy problem
Alexander Schaub, Olivier Rioul, Jean‐Luc Danger, Sylvain Guilley, Joseph J. Boutros · Advances in Mathematics of Communications · 2020
Motivated by a security application on physically unclonable functions, we evaluate the probability distributions and Rényi entropies of signs of scalar products of i.i.d. Gaussian random variables against binary codewords in $ \{\pm1\}^n $. The exact distributions are determined for small values of $ n $ and upper bounds are provided by linking this problem to the study of Boolean threshold functions. Finally, Monte-Carlo simulations are used to approximate entropies up to $ n = 10 $.