一个2.17-pJ/b 5b响应抗攻击、增强统计性能的强PUF

Kunyang Liu, Gen Li, Zihan Fu, Xuanzhen Wang, H. Shinohara
{"title":"一个2.17-pJ/b 5b响应抗攻击、增强统计性能的强PUF","authors":"Kunyang Liu, Gen Li, Zihan Fu, Xuanzhen Wang, H. Shinohara","doi":"10.1109/ESSCIRC55480.2022.9911472","DOIUrl":null,"url":null,"abstract":"This article presents a Strong physically unclonable function (PUF) with a 5-bit response output, which alleviates the critical issue of huge challenge-response pair (CRP) consumption for one authentication. Attack resistance is enhanced not only by improving the substitution-permutation network (SPN) using variable secret look-up tables (LUTs) and a complex permutation XOR box but also by mitigating LUT data collision and coupling Strong PUF functions between adjacent operation rounds to protect an individual round from attack. As a result, response bitstreams pass all NIST SP800-22 randomness tests even using highly correlated challenge inputs, and mainstream modeling attacks with up to 200-Mb training samples cannot achieve higher accuracy than random guess. An automatic data write-back circuit allows the PUF to be fully stabilized by hot carrier injection (HCI) burn-in without exposing sensitive LUT data. The architecture realizes a 1-cycle/round operation and results in 2.17 pJ/b energy and 0.625 bit/cycle throughput.","PeriodicalId":168466,"journal":{"name":"ESSCIRC 2022- IEEE 48th European Solid State Circuits Conference (ESSCIRC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A 2.17-pJ/b 5b-Response Attack-Resistant Strong PUF with Enhanced Statistical Performance\",\"authors\":\"Kunyang Liu, Gen Li, Zihan Fu, Xuanzhen Wang, H. Shinohara\",\"doi\":\"10.1109/ESSCIRC55480.2022.9911472\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article presents a Strong physically unclonable function (PUF) with a 5-bit response output, which alleviates the critical issue of huge challenge-response pair (CRP) consumption for one authentication. Attack resistance is enhanced not only by improving the substitution-permutation network (SPN) using variable secret look-up tables (LUTs) and a complex permutation XOR box but also by mitigating LUT data collision and coupling Strong PUF functions between adjacent operation rounds to protect an individual round from attack. As a result, response bitstreams pass all NIST SP800-22 randomness tests even using highly correlated challenge inputs, and mainstream modeling attacks with up to 200-Mb training samples cannot achieve higher accuracy than random guess. An automatic data write-back circuit allows the PUF to be fully stabilized by hot carrier injection (HCI) burn-in without exposing sensitive LUT data. The architecture realizes a 1-cycle/round operation and results in 2.17 pJ/b energy and 0.625 bit/cycle throughput.\",\"PeriodicalId\":168466,\"journal\":{\"name\":\"ESSCIRC 2022- IEEE 48th European Solid State Circuits Conference (ESSCIRC)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ESSCIRC 2022- IEEE 48th European Solid State Circuits Conference (ESSCIRC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ESSCIRC55480.2022.9911472\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ESSCIRC 2022- IEEE 48th European Solid State Circuits Conference (ESSCIRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ESSCIRC55480.2022.9911472","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一个具有5位响应输出的强物理不可克隆函数(PUF),它缓解了一次身份验证消耗大量挑战响应对(CRP)的关键问题。通过使用可变秘密查找表(LUT)和复杂排列异或盒改进替换置换网络(SPN),减少LUT数据冲突,并在相邻操作轮之间耦合强PUF函数以保护单个轮不受攻击,从而增强了网络的抗攻击能力。因此,即使使用高度相关的挑战输入,响应比特流也通过了NIST SP800-22的所有随机性测试,主流的建模攻击高达200mb的训练样本也无法达到比随机猜测更高的准确率。自动数据回写电路允许PUF通过热载流子注入(HCI)烧入完全稳定,而不会暴露敏感的LUT数据。该架构实现了1周期/轮的运算,能量为2.17 pJ/b,吞吐量为0.625 bit/cycle。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A 2.17-pJ/b 5b-Response Attack-Resistant Strong PUF with Enhanced Statistical Performance
This article presents a Strong physically unclonable function (PUF) with a 5-bit response output, which alleviates the critical issue of huge challenge-response pair (CRP) consumption for one authentication. Attack resistance is enhanced not only by improving the substitution-permutation network (SPN) using variable secret look-up tables (LUTs) and a complex permutation XOR box but also by mitigating LUT data collision and coupling Strong PUF functions between adjacent operation rounds to protect an individual round from attack. As a result, response bitstreams pass all NIST SP800-22 randomness tests even using highly correlated challenge inputs, and mainstream modeling attacks with up to 200-Mb training samples cannot achieve higher accuracy than random guess. An automatic data write-back circuit allows the PUF to be fully stabilized by hot carrier injection (HCI) burn-in without exposing sensitive LUT data. The architecture realizes a 1-cycle/round operation and results in 2.17 pJ/b energy and 0.625 bit/cycle throughput.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信