LISA: Maximizing RO PUF's secret extraction

C. Yin, G. Qu
{"title":"LISA: Maximizing RO PUF's secret extraction","authors":"C. Yin, G. Qu","doi":"10.1109/HST.2010.5513105","DOIUrl":null,"url":null,"abstract":"The silicon physical unclonable functions (PUF) measure uncontrollable variations of the integrated circuit (IC) fabrication process to facilitate IC authentication. One of the most reliable silicon PUF structures is the ring oscillator (RO) PUF; however, the lack of efficient secret extraction schemes diminishes its practicality. In this work, we propose a longest increasing subsequence-based grouping algorithm (LISA) to enhance the hardware utilization. To analyze the performance of LISA, we introduce a hybrid architecture and formulate its cost and delay metrics; by solving the introduced hybrid coefficient, RO PUF designers can quickly determine the optimal hardware configuration. Finally, our claims are validated by a proof-of-the-concept FPGA-based implementation.","PeriodicalId":6367,"journal":{"name":"2010 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST)","volume":"23 1","pages":"100-105"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"127","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HST.2010.5513105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 127

Abstract

The silicon physical unclonable functions (PUF) measure uncontrollable variations of the integrated circuit (IC) fabrication process to facilitate IC authentication. One of the most reliable silicon PUF structures is the ring oscillator (RO) PUF; however, the lack of efficient secret extraction schemes diminishes its practicality. In this work, we propose a longest increasing subsequence-based grouping algorithm (LISA) to enhance the hardware utilization. To analyze the performance of LISA, we introduce a hybrid architecture and formulate its cost and delay metrics; by solving the introduced hybrid coefficient, RO PUF designers can quickly determine the optimal hardware configuration. Finally, our claims are validated by a proof-of-the-concept FPGA-based implementation.
莉莎:最大限度地挖掘RO PUF的秘密
硅物理不可克隆函数(PUF)测量集成电路(IC)制造过程中的不可控变化,以方便集成电路认证。最可靠的硅PUF结构之一是环形振荡器(RO) PUF;然而,缺乏有效的秘密提取方案降低了其实用性。在这项工作中,我们提出了一种基于最长递增子序列的分组算法(LISA)来提高硬件利用率。为了分析LISA的性能,我们引入了一种混合架构,并制定了其成本和延迟指标;通过求解引入的混合系数,RO PUF设计人员可以快速确定最佳硬件配置。最后,通过基于fpga的概念验证实现验证了我们的主张。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信