基于极化码的稳健SRAM-PUF密钥生成方案
A Robust SRAM-PUF Key Generation Scheme Based on Polar Codes
摘要：
物理不可克隆功能（PUF）是用于设备认证和设备特定的秘密密钥生成的相对较新的安全原语。在本文中，我们专注于SRAM-PUFs。SRAM-PUF享有源自SRAM存储单元的固有随机性的唯一性和随机性属性，这是制造变化的结果。这种随机性可以被转换成密码密钥，从而避免了存储和管理设备密码密钥的需要。因此，这些特性，再加上SRAM存储器经常出现在当今的物联网设备中，使得SRAM-PUF成为资源受限的物联网设备的安全和认证的有希望的候选者。PUF观测总是受到噪声和环境变化的影响。因此，使用具有帮助数据的秘密生成方案来保证基于PUF的秘密密钥的可靠再生。纠错码（ECC）是这些方案的重要组成部分。在这项工作中，我们提出了一个实用的纠错构造基于PUF的秘密生成的基础上极化码。所得到的方案可以使用$1024$ SRAM-PUF比特和$896$辅助数据比特来生成$128$比特密钥，并且对于具有$15\%$的比特错误概率的实际SRAM-PUF设置，实现$10^{-9}$或更低的故障概率。该方法是基于连续取消结合列表解码和基于散列的检查，利用散列已经在解码器。此外，研究了一种极化码的自适应列表译码器。此解码器仅在需要时增加列表大小。
英文摘要：
Physical unclonable functions (PUFs) are relatively new security primitives used for device authentication and device-specific secret key generation. In this paper we focus on SRAM-PUFs. The SRAM-PUFs enjoy uniqueness and randomness properties stemming from the intrinsic randomness of SRAM memory cells, which is a result of manufacturing variations. This randomness can be translated into the cryptographic keys thus avoiding the need to store and manage the device cryptographic keys. Therefore these properties, combined with the fact that SRAM memory can be often found in today's IoT devices, make SRAM-PUFs a promising candidate for securing and authentication of the resource-constrained IoT devices. PUF observations are always effected by noise and environmental changes. Therefore secret-generation schemes with helper data are used to guarantee reliable regeneration of the PUF-based secret keys. Error correction codes (ECCs) are an essential part of these schemes. In this work, we propose a practical error correction construction for PUF-based secret generation that are based on polar codes. The resulting scheme can generate $128$-bit keys using $1024$ SRAM-PUF bits and $896$ helper data bits and achieve a failure probability of $10^{-9}$ or lower for a practical SRAM-PUFs setting with bit error probability of $15\%$. The method is based on successive cancellation combined with list decoding and hash-based checking that makes use of the hash that is already available at the decoder. In addition, an adaptive list decoder for polar codes is investigated. This decoder increases the list size only if needed.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
