仲裁人
现场可编程门阵列
计算机科学
密码学
嵌入式系统
独特性
理论计算机科学
并行计算
计算机安全
数学
数学分析
作者
N. Nalla Anandakumar,Mohammad S. Hashmi,Muhammad Akmal Chaudhary
出处
期刊:IEEE Access
[Institute of Electrical and Electronics Engineers]
日期:2022-01-01
卷期号:10: 129832-129842
被引量:15
标识
DOI:10.1109/access.2022.3228635
摘要
Physically unclonable functions (PUFs) are recently utilized as a promising security solution for authentication and identification of internet of things (IoT) devices. In this article, we present an efficient implementation of XOR Arbiter PUF (XOR APUF) on field-programmable gate arrays (FPGAs). In our work, we incorporated concept of discrete programmable delays logic (PDL) configurations, the obfuscated challenges and temporal majority voting (TMV) before the XOR operation concurrently to enhance uniqueness and security. The derived design has been verified on 25 Xilinx Artix-7 FPGAs and the results are promising with uniqueness of 48.69%, uniformity 50.73% and reliability 99.41%, which significantly improves over previous work into XOR APUF designs. In addition, we also investigate modeling attack resistance of the proposed design against various modelling attacks and the security analysis show that the proposed PUF has lower prediction rate (<65%) when compared to the previous XOR APUF designs.
科研通智能强力驱动
Strongly Powered by AbleSci AI