A 0.46pJ/bit Ultralow-Power Entropy-Preselection-Based Strong PUF with Worst-Case BER<6.7×10-6

Jiahao Liu, Yan Zhu, Chi-Hang Chan, R. Martins
{"title":"A 0.46pJ/bit Ultralow-Power Entropy-Preselection-Based Strong PUF with Worst-Case BER<6.7×10-6","authors":"Jiahao Liu, Yan Zhu, Chi-Hang Chan, R. Martins","doi":"10.1109/A-SSCC53895.2021.9634795","DOIUrl":null,"url":null,"abstract":"Internet of things (IoT) devices become ubiquitous, interconnected platforms for everyday tasks, which dictate a growing demand for low-cost security primitives. Physically Unclonable Functions (PUFs) are one of the promising solutions for low-cost key storage and device authentication, where strong PUFs [1–5] are suitable for authentication due to the exponentially large challenge-response pairs (CRPs) space. Early strong PUFs were vulnerable to machine learning (ML) attacks [3], [4], while [1], [2], [5] introduce various nonlinear entropy cells to enhance resilience. However, they all suffer from low energy efficiency because many trivial entropy cells need to be activated for sufficient nonlinearity. Besides, with many enabled cells, a small number of challenge bits flipping only imposes a very small probability for the change on the final response, resulting in a poor standard deviation on their Hamming Weight (HW).","PeriodicalId":286139,"journal":{"name":"2021 IEEE Asian Solid-State Circuits Conference (A-SSCC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE Asian Solid-State Circuits Conference (A-SSCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/A-SSCC53895.2021.9634795","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Internet of things (IoT) devices become ubiquitous, interconnected platforms for everyday tasks, which dictate a growing demand for low-cost security primitives. Physically Unclonable Functions (PUFs) are one of the promising solutions for low-cost key storage and device authentication, where strong PUFs [1–5] are suitable for authentication due to the exponentially large challenge-response pairs (CRPs) space. Early strong PUFs were vulnerable to machine learning (ML) attacks [3], [4], while [1], [2], [5] introduce various nonlinear entropy cells to enhance resilience. However, they all suffer from low energy efficiency because many trivial entropy cells need to be activated for sufficient nonlinearity. Besides, with many enabled cells, a small number of challenge bits flipping only imposes a very small probability for the change on the final response, resulting in a poor standard deviation on their Hamming Weight (HW).
基于0.46pJ/bit的最坏误码率<6.7×10-6的超低功率熵预选强PUF
物联网(IoT)设备成为无处不在的日常任务互联平台,这决定了对低成本安全原语的需求不断增长。物理不可克隆函数(physical unclable Functions, puf)是低成本密钥存储和设备认证的有前途的解决方案之一,其中强puf[1-5]适合于认证,因为它具有指数级大的挑战响应对(challenge-response pairs, CRPs)空间。早期的强puf容易受到机器学习(ML)攻击[3],[4],而[1],[2],[5]引入各种非线性熵单元来增强弹性。然而,它们的能量效率都很低,因为许多微不足道的熵单元需要被激活以获得足够的非线性。此外,对于许多启用的单元,少量的挑战位翻转只会对最终响应的变化施加非常小的概率,导致其汉明权重(HW)的标准偏差很差。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信