Multi-block APUF with 2-Level Voltage Supply

Yunxi Guo, Timothy Dee, A. Tyagi
{"title":"Multi-block APUF with 2-Level Voltage Supply","authors":"Yunxi Guo, Timothy Dee, A. Tyagi","doi":"10.1109/ISVLSI.2018.00067","DOIUrl":null,"url":null,"abstract":"Physical Unclonable Functions (PUFs) are hardware cryptographic primitives for generating unique signatures from device manufacturing variations. Arbiter PUFs (APUFs) are a widely used class of PUF detecting process variations by exploiting the propagation delay differences between signals. However, both FPGA and ASIC implementations of APUFs suffer from systematic bias caused by either asymmetric routing or gradient effects in wafer doping. In this work, we introduce an improved APUF ASIC implementation achieving entropy enhancement without increasing area and power consumption significantly. In this design, a selector chain is divided into multiple blocks to avoid accumulation of systematic variation. Different voltage supplies are chosen for selector chain and arbiter circuit to overcome reliability problems produced by short chains. Cadence Monte Carlo sampling on 256-stage APUFs built in IBM 0.13µm technology shows the proposed Multi-Block (MB-) APUFs provide inter-chip uniqueness and reproducibility similar to double APUF (DAPUF); compared to DAPUF with similar uniqueness performance, MBAPUFs decrease area and power consumption by a factor of 2.","PeriodicalId":114330,"journal":{"name":"2018 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVLSI.2018.00067","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Physical Unclonable Functions (PUFs) are hardware cryptographic primitives for generating unique signatures from device manufacturing variations. Arbiter PUFs (APUFs) are a widely used class of PUF detecting process variations by exploiting the propagation delay differences between signals. However, both FPGA and ASIC implementations of APUFs suffer from systematic bias caused by either asymmetric routing or gradient effects in wafer doping. In this work, we introduce an improved APUF ASIC implementation achieving entropy enhancement without increasing area and power consumption significantly. In this design, a selector chain is divided into multiple blocks to avoid accumulation of systematic variation. Different voltage supplies are chosen for selector chain and arbiter circuit to overcome reliability problems produced by short chains. Cadence Monte Carlo sampling on 256-stage APUFs built in IBM 0.13µm technology shows the proposed Multi-Block (MB-) APUFs provide inter-chip uniqueness and reproducibility similar to double APUF (DAPUF); compared to DAPUF with similar uniqueness performance, MBAPUFs decrease area and power consumption by a factor of 2.
带2级电压电源的多块APUF
物理不可克隆函数(puf)是用于从设备制造变化中生成唯一签名的硬件加密原语。仲裁PUF (apuf)是一类广泛使用的PUF,通过利用信号之间的传播延迟差异来检测过程变化。然而,apuf的FPGA和ASIC实现都受到晶圆掺杂中不对称路由或梯度效应引起的系统偏置的影响。在这项工作中,我们介绍了一种改进的APUF ASIC实现,在不显著增加面积和功耗的情况下实现熵增强。在本设计中,为了避免系统变异的积累,选择链被划分为多个块。选择链和仲裁电路选择不同的电压源,克服短链产生的可靠性问题。采用IBM 0.13µm技术构建的256级APUF的Cadence蒙特卡罗采样表明,所提出的多块(MB-) APUF具有与双APUF (DAPUF)相似的芯片间唯一性和再现性;与具有相似唯一性性能的DAPUF相比,mbapuf的面积和功耗降低了2倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信