电子学报2024，Vol.52Issue(5)：1478-1487,10.DOI:10.12263/DZXB.20221413
基于数据残留时间的SRAM-PUF预选算法
SRAM-PUF Preselection Algorithm Based on Data Remanence Time
摘要
Abstract
Static random-access memory(SRAM)physical unclonable function(PUF)makes use of the process devi-ation in the manufacturing process of transistors with identical parameter design,which generates the key response that can-not be cloned for each chip.Due to the randomness of SRAM-PUF internal error distribution,key reconstruction requires the use of error correction codes,and the area of error correction circuits is positively related to its error correction capabili-ty.In order to reduce the error distribution of SRAM-PUF and reduce the area of error correction circuits,this paper propos-es a data remanence preselection algorithm through the research on characteristics of SRAM data remanence,screening SRAM cells,improving the stability of PUF response,and screening SRAM blocks using block optimization algorithm,re-duce the dispersion of the response,which generates SRAM PUF response in a shorter time and resource consumption.Ex-perimental results show that 256 bits SRAM-PUF response has 99.8％stability and 1.9×10-8 bit error rate under different temperatures(-40℃～80℃)and±10％voltage fluctuations.Compared with the general temporary majority voting(TMV)algorithm,the stability is improved by 1.7％and the error rate is reduced by 2.1×105 times,compared with 1 000 times of TMV,linear reduction of time complexity from O(2 000n)to O(900n).After 72 hours of aging testing,the stability of the SRAM-PUF pre-selected using the data remanence algorithm only decreased by 0.2％.关键词
物理不可克隆函数/SRAM/预选算法/数据残留/临时多数表决Key words
physically unclonable function/sram/preselection algorithm/data remanence/temporary majority voting分类
信息技术与安全科学引用本文复制引用
陈泽亮,孔德珠,尹爱国,陈泽福,张培勇..基于数据残留时间的SRAM-PUF预选算法[J].电子学报,2024,52(5):1478-1487,10.基金项目
国家重点研发计划(No.2021YFB2206200) National Key Research and Development Program of China(No.2021YFB2206200) （No.2021YFB2206200）
