An SR Flip-Flop based Physical Unclonable Functions for Hardware Security

09/11/2019
by   Rohith Prasad Challa, et al.
0

Physical Unclonable Functions (PUFs) have emerged as a promising solution to identify and authenticate Integrated Circuits (ICs). In this paper, we propose a novel NAND-based Set-Reset (SR) Flip-flop (FF) PUF design for security enclosures of the area- and power-constrained Internet-of-Things (IoT) edge node. Such SR-FF based PUF is constructed during a unique race condition that is (normally) avoided due to inconsistency. We have shown, when both inputs (S and R) are logic high ('1') and followed by logic zero ('0'), the outputs Q and Qbar can settle down to either 0 or 1 or vice-versa depending on statistical delay variations in cross-coupled paths. We incorporate the process variations during SPICE-level simulations to leverage the capability of SR-FF in generating the unique identifier of an IC. Experimental results for 90nm, 45nm, and 32nm process nodes show the robustness of SR-FF PUF responses in terms of uniqueness, randomness, uniformity, and bit(s) biases. Furthermore, we perform physical synthesis to evaluate the applicability of SR FF PUF on five designs from OpenCores in three design corners. The estimated overhead for power, timing, and area in three design corners are negligible.

READ FULL TEXT

page 2

page 3

page 4

page 5

research
03/24/2021

A Challenge Obfuscating Interface for Arbiter PUF Variants against Machine Learning Attacks

Security is of critical importance for the Internet of Things (IoT). Man...
research
12/07/2020

Low-Latency Asynchronous Logic Design for Inference at the Edge

Modern internet of things (IoT) devices leverage machine learning infere...
research
07/19/2023

EPUF: A Novel Scheme Based on Entropy Features of Latency-based DRAM PUFs Providing Lightweight Authentication in IoT Networks

Physical unclonable functions (PUFs) are hardware-oriented primitives th...
research
08/07/2020

A General Framework for Stable Roommates Problems using Answer Set Programming

The Stable Roommates problem (SR) is characterized by the preferences of...
research
10/18/2021

Deploying Near-Optimal Delay-Constrained Paths with Segment Routing in Massive-Scale Networks

With a growing demand for quasi-instantaneous communication services suc...
research
12/06/2020

MeLPUF: Memory in Logic PUF

Physical Unclonable Functions (PUFs) are used for securing electronic de...
research
11/10/2020

Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think

With the growth of demands for quasi-instantaneous communication service...

Please sign up or login with your details

Forgot password? Click here to reset