冯志华, 张苗, 邹雪城, 刘政林. 适用于SRAM-PUF的纠错码研究[J]. 微电子学与计算机, 2016, 33(6): 11-13.
引用本文: 冯志华, 张苗, 邹雪城, 刘政林. 适用于SRAM-PUF的纠错码研究[J]. 微电子学与计算机, 2016, 33(6): 11-13.
FENG Zhi-hua, ZHANG Miao, ZOU Xue-cheng, LIU Zheng-lin. Study on Error Correcting Code Applied to SRAM-PUF[J]. Microelectronics & Computer, 2016, 33(6): 11-13.
Citation: FENG Zhi-hua, ZHANG Miao, ZOU Xue-cheng, LIU Zheng-lin. Study on Error Correcting Code Applied to SRAM-PUF[J]. Microelectronics & Computer, 2016, 33(6): 11-13.

适用于SRAM-PUF的纠错码研究

Study on Error Correcting Code Applied to SRAM-PUF

  • 摘要: 物理不可克隆函数(Physical Uncloneable Functions, PUFs)能够产生、存储密钥, 可以抵御侵入攻击的威胁.利用SRAM PUF进行密钥提取时, 需用纠错编码来恢复密钥源数据, 通常采用BCH纠错码, 但是BCH的迭代译码算法复杂, 单纯地利用BCH编码使得硬件开销大.本文提出一种级联编码方案, 将较长码字分成两个较短码字逐级编译码, 仿真结果表明本文所提的级联编码方案能够满足SRAM-PUF纠错率的要求.

     

    Abstract: Physical Unclonable Function(PUF)can generate and store security keys in a way that can prevent them from assaulting attacks. When deploying PUF to extract the keys, we have to apply Error Correcting Code where the BCH code is the most often used to reconstruct the source data of security key. But the decoding algorithm of BCH is complex, making it hardware-inefficient when using BCH code only.This paper proposed a concatenated construction by splitting a longer code into two shorter codes and then decoding in two steps. The results of simulation show the construction based on concatenate codes can meet the need of SRAM-PUF's error rate.

     

/

返回文章
返回