SPN-DPUF: Substitution-Permutation Network Based Secure Circuit for Digital PUF

Johan Marconot, D. Hély, Florian Pebay-Peyroula
{"title":"SPN-DPUF: Substitution-Permutation Network Based Secure Circuit for Digital PUF","authors":"Johan Marconot, D. Hély, Florian Pebay-Peyroula","doi":"10.1109/ISVLSI.2019.00018","DOIUrl":null,"url":null,"abstract":"Securing integrated circuits lifecycle requires authentication mechanisms in order to prevent counterfeiting and to prevent illegal access to private assets. Physical unclonable functions (PUFs) are good candidates to provide authentication services. However, PUFs may be sensitive to noise and environmental conditions inducing reliability issues. Digital PUFs (DPUFs), which are by design inherently robust, have recently been proposed. In this paper, we investigate the utilization, the security and the efficiency of interrogation circuitries for DPUFs. We present the concept of digital disorder based PUF primitives and related work on fabrication processes and interrogation circuitries for DPUFs, discussing their advantage and limitation. We then study the requirements to exploit this digital and reliable source of entropy and deploy a strong PUF design. We propose new models of logical layers for challenge-response mechanism based on substitution-permutation networks, which could be integrated along the randomized structure. We simulate and evaluate the different structures to estimate a first security-performance trade-off, respecting both security and resource constraints.","PeriodicalId":6703,"journal":{"name":"2019 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","volume":"9 1","pages":"49-54"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVLSI.2019.00018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Securing integrated circuits lifecycle requires authentication mechanisms in order to prevent counterfeiting and to prevent illegal access to private assets. Physical unclonable functions (PUFs) are good candidates to provide authentication services. However, PUFs may be sensitive to noise and environmental conditions inducing reliability issues. Digital PUFs (DPUFs), which are by design inherently robust, have recently been proposed. In this paper, we investigate the utilization, the security and the efficiency of interrogation circuitries for DPUFs. We present the concept of digital disorder based PUF primitives and related work on fabrication processes and interrogation circuitries for DPUFs, discussing their advantage and limitation. We then study the requirements to exploit this digital and reliable source of entropy and deploy a strong PUF design. We propose new models of logical layers for challenge-response mechanism based on substitution-permutation networks, which could be integrated along the randomized structure. We simulate and evaluate the different structures to estimate a first security-performance trade-off, respecting both security and resource constraints.
SPN-DPUF:基于替换置换网络的数字PUF安全电路
确保集成电路的生命周期需要认证机制,以防止假冒和防止非法访问私人资产。物理不可克隆函数(puf)是提供身份验证服务的良好候选者。然而,puf可能对噪声和环境条件敏感,从而导致可靠性问题。数字puf (dpuf)在设计上具有固有的鲁棒性,最近被提出。本文研究了dpuf讯问电路的利用率、安全性和效率。我们提出了基于数字无序的PUF原语的概念,以及dpuf的制造工艺和询问电路的相关工作,讨论了它们的优点和局限性。然后我们研究了利用这个数字和可靠的熵源的需求,并部署了一个强大的PUF设计。提出了基于替代置换网络的挑战-响应机制的逻辑层模型,该模型可以沿随机结构集成。我们模拟和评估不同的结构,以估计第一个安全性能权衡,同时尊重安全和资源约束。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信