论文标题

低复杂性和可靠的物理不荡情功能的可靠变换

Low-complexity and Reliable Transforms for Physical Unclonable Functions

论文作者

Günlü, Onur, Schaefer, Rafael F.

论文摘要

物理不元件功能(PUF)的嘈杂测量值用于存储具有可靠性,安全性,隐私和复杂性约束的秘密键。提出了一组新的低复杂性和正交变换,没有提出无乘法的情况,以获得比以前提出的用于与PUF的键结合的所有方法的明显更好。从提议的集合中选择的转换的独特性和安全性能显示为接近最佳。证明具有低复杂解码器和高码速率的错误校正代码可提供比先前建议的代码相同或更小的代码速率所提供的块误差概率明显小。

Noisy measurements of a physical unclonable function (PUF) are used to store secret keys with reliability, security, privacy, and complexity constraints. A new set of low-complexity and orthogonal transforms with no multiplication is proposed to obtain bit-error probability results significantly better than all methods previously proposed for key binding with PUFs. The uniqueness and security performance of a transform selected from the proposed set is shown to be close to optimal. An error-correction code with a low-complexity decoder and a high code rate is shown to provide a block-error probability significantly smaller than provided by previously proposed codes with the same or smaller code rates.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源