Mathematical Model of Strong Physically Unclonable Functions Based on Hybrid Boolean Networks

07/20/2022
by   Noeloikeau Charlot, et al.
0

We introduce a mathematical framework for simulating Hybrid Boolean Network (HBN) Physically Unclonable Functions (PUFs, HBN-PUFs). We verify that the model is able to reproduce the experimentally observed PUF statistics for uniqueness μ_inter and reliability μ_intra obtained from experiments of HBN-PUFs on Cyclone V FPGAs. Our results suggest that the HBN-PUF is a true `strong' PUF in the sense that its security properties depend exponentially on both the manufacturing variation and the challenge-response space. Our Python simulation methods are open-source and available at https://github.com/Noeloikeau/networkm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/29/2019

Transient Response of Hybrid Boolean Networks as Physical Unclonable Functions

Physical unclonable functions are devices that exploit small, random var...
research
06/11/2021

Revealing the canalizing structure of Boolean functions: Algorithms and applications

Boolean functions can be represented in many ways including logical form...
research
02/15/2022

Sensitivity of a Chaotic Logic Gate

Chaotic logic gates or `chaogates' are a promising mixed-signal approach...
research
02/16/2022

Modeling Strong Physically Unclonable Functions with Metaheuristics

Evolutionary algorithms have been successfully applied to attacking Phys...
research
07/11/2019

Entropy Estimation of Physically Unclonable Functions via Chow Parameters

A physically unclonable function (PUF) is an electronic circuit that pro...
research
10/20/2018

Testability Analysis of PUFs Leveraging Correlation-Spectra in Boolean Functions

Testability of digital ICs rely on the principle of controllability and ...

Please sign up or login with your details

Forgot password? Click here to reset