Cryptology ePrint Archive: Report 2016/428

An Efficient and Scalable Modeling Attack on Lightweight Secure Physically Unclonable Function

Phuong Ha Nguyen and Durga Prasad Sahoo

Abstract: The Lightweight Secure Physically Unclonable Function (LSPUF) was proposed as a secure composition of Arbiter PUFs with additional XOR based input and output networks. But later, researchers proposed a Machine Learning (ML) based modeling attack on $x$-XOR LSPUF, and they also empirically showed that pure ML based modeling is not computationally scalable if the parameter $x$ of $x$-XOR LSPUF is larger than nine. Besides this pure computational attack using only challenge-response pairs (CRPs), there are other proposals for modeling attacks on LSPUF using timing and power side-channel information, reliability information and photonic side-channel information of an LSPUF instance. % In this paper, we proposed another pure computational attack (i.e. without any side-channel information) on multibit output LSPUF variants using both cryptanalysis and ML techniques together. We, first, cryptanalyze the output network of LSPUF to reduce the computational efforts required by previously proposed pure ML based modeling of an $x$-XOR LSPUF. Specifically, we model an LSPUF instance, while its output bit is defined as $x$-XOR PUF, using the ML modeling of $y$-XOR PUF where $y<x$. From the computational complexity view point, our proposed modeling attack is efficient and scalable than previously proposed pure ML based modeling of LSPUFs with respect to both data and time complexities. We demonstrate the effectiveness of our proposed attack using the Matlab based simulation of LSPUFs and LSPUFs implemented on Xilinx Artix-7 Field Programmable Gate Arrays (FPGAs).

Category / Keywords: applications / Cryptanalysis, hardware--intrinsic security, lightweight secure PUFs, logistic regression, machine learning, modeling attack, physically unclonable function (PUF).

Date: received 30 Apr 2016

Contact author: dpsahoo cs at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20160501:132335 (All versions of this report)

Short URL: ia.cr/2016/428

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]