arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.08084cs.CR

CycPUF:循环物理不可克隆函数

CycPUF: Cyclic Physical Unclonable Function

Michael Dominguez, Amin Rezaei

AI总结:

本文提出CycPUF,通过在传统基于延迟的PUF中引入反馈信号形成循环结构,扩展输出行为范围,增强对机器学习建模攻击的抵抗力,并在FPGA上验证其安全性与开销。

摘要:

物理不可克隆函数(PUF)利用制造工艺缺陷引起的信号传播延迟差异。尽管PUF可用于设备认证和芯片特定密钥生成,但强PUF已被证明易受机器学习建模攻击。尽管传统观念认为组合电路设计不应包含环路,但循环组合电路已被证明能增强对硬件知识产权窃取的防护。本文将反馈信号引入传统基于延迟的PUF设计(如arbiter PUF、ring oscillator PUF和butterfly PUF),使其输出行为范围更广,从而获得对抗建模攻击的优势。分析表明,在固定挑战下,循环PUF可产生二进制、稳态、振荡或伪随机的响应。所提出的循环PUF在现场可编程门阵列中实现,并报告了与传统对应物相比的功耗和面积开销及功能指标。此外,还展示了所提循环PUF针对最先进攻击的安全性提升。

英文摘要:

Physical Unclonable Functions (PUFs) leverage manufacturing process imperfections that cause propagation delay discrepancies for the signals traveling along these paths. While PUFs can be used for device authentication and chip-specific key generation, strong PUFs have been shown to be vulnerable to machine learning modeling attacks. Although there is an impression that combinational circuits must be designed without any loops, cyclic combinational circuits have been shown to increase design security against hardware intellectual property theft. In this paper, we introduce feedback signals into traditional delay-based PUF designs such as arbiter PUF, ring oscillator PUF, and butterfly PUF to give them a wider range of possible output behaviors and thus an edge against modeling attacks. Based on our analysis, cyclic PUFs produce responses that can be binary, steady-state, oscillating, or pseudo-random under fixed challenges. The proposed cyclic PUFs are implemented in field programmable gate arrays, and their power and area overhead, in addition to functional metrics, are reported compared with their traditional counterparts. The security gain of the proposed cyclic PUFs is also shown against state-of-the-art attacks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑