A Fast Deep Learning Method for Security Vulnerability Study of XOR PUFs

• Published in: Electronics (Basel) Vol. 9; no. 10; p. 1715
• Main Authors: Mursi, Khalid T., Thapaliya, Bipana, Zhuang, Yu, Aseeri, Ahmad O., Alkatheiri, Mohammed Saeed
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 18.10.2020
• Subjects: Accuracy; Computational efficiency; Computing time; Cryptography; Deep learning; Gates (circuits); Internet of Things; Machine learning; Methods; Neural networks; Support vector machines
• ISSN: 2079-9292; 2079-9292
• DOI: 10.3390/electronics9101715

Physical unclonable functions (PUF) are emerging as a promising alternative to traditional cryptographic protocols for IoT authentication. XOR Arbiter PUFs (XPUFs), a group of well-studied PUFs, are found to be secure against machine learning (ML) attacks if the XOR gate is large enough, as both the number of CRPs and the computational time required for modeling n-XPUF increases fast with respect to n, the number of component arbiter PUFs. In this paper, we present a neural network-based method that can successfully attack XPUFs with significantly fewer CRPs and shorter learning time when compared with existing ML attack methods. Specifically, the experimental study in this paper shows that our new method can break the 64-bit 9-XPUF within ten minutes of learning time for all of the tested samples and runs, with magnitudes faster than the fastest existing ML attack method, which takes over 1.5 days of parallel computing time on 16 cores.