It is shown that a class of optical physical unclonable functions (PUFs) can be learned to arbitrary precision with arbitrarily high probability, even in the presence of noise, given access to polynomially many challenge-response pairs and polynomially bounded computational power, under mild assumptions about the distributions of the noise and challenge vectors. This extends the results of Rh\"uramir et al. (2013), who showed a subset of this class of PUFs to be learnable in polynomial time in the absence of noise, under the assumption that the optics of the PUF were either linear or had negligible nonlinear effects. We derive polynomial bounds for the required number of samples and the computational complexity of a linear regression algorithm, based on size parameters of the PUF, the distributions of the challenge and noise vectors, and the probability and accuracy of the regression algorithm, with a similar analysis to one done by Bootle et al. (2018), who demonstrated a learning attack on a poorly implemented version of the Learning With Errors problem.

翻译：本文证明，在关于噪声和挑战向量分布的温和假设下，即使存在噪声，一类光学物理不可克隆函数（PUF）也可通过多项式数量的挑战-响应对及多项式有界计算能力，以任意精度和任意高概率被学习。这一结果扩展了Rhűramir等人（2013）的研究——他们曾在无噪声条件下、假设PUF光学系统为线性或非线性效应可忽略时，证明此类PUF的子集可在多项式时间内被学习。我们基于PUF的尺寸参数、挑战向量和噪声向量的分布、回归算法的概率与精度，推导了线性回归算法所需样本数量与计算复杂度的多项式界，其分析方式与Bootle等人（2018）针对带错误学习问题（LWE）的弱实现版本所开展的学习攻击分析类似。