Breaking XOR Arbiter PUFs without Reliability Information
CoRR(2023)
摘要
Unreliable XOR Arbiter PUFs were broken by a machine learning attack, which
targets the underlying Arbiter PUFs individually. However, reliability
information from the PUF was required for this attack.
We show that, for the first time, a perfectly reliable XOR Arbiter PUF, where
no reliability information is accessible, can be efficiently attacked in the
same divide-and-conquer manner. Our key insight is that the responses of
correlated challenges also reveal their distance to the decision boundary. This
leads to a chosen challenge attack on XOR Arbiter PUFs. The effectiveness of
our attack is confirmed through PUF simulation and FPGA implementation.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要