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 $.

中文翻译：

---

具有高斯延迟的物理不可克隆函数的质询代码：最大熵问题

受关于物理不可克隆函数的安全应用程序的启发，我们针对$ \ {\ pm1 \} ^ n $中的二进制码字评估iid高斯随机变量的标量积的符号的概率分布和Rényi熵。对于$ n $的较小值，可以确定确切的分布，并且可以通过将该问题与布尔阈值函数的研究联系起来来提供上限。最后，蒙特卡洛模拟用于近似熵，直到$ n = 10 $。