Hybrid Boolean Networks as Physically Unclonable Functions

نویسندگان

چکیده

We introduce a Physically Unclonable Function (PUF) based on an ultra-fast chaotic network known as Hybrid Boolean Network (HBN) implemented field programmable gate array. The network, consisting of N coupled asynchronous logic gates displaying dynamics the sub-nanosecond time scale, acts `digital fingerprint' by amplifying small manufacturing variations during period transient chaos. In contrast to other PUF designs, we use both N-bits per challenge and obtain response considering challenges be initial states N-node responses captured subsequent transient. find that presence chaos amplifies frozen-in randomness due differences extractable entropy is approximately 50% maximum N2 N bits. uniqueness reliability metrics μ inter = 0.40±0.01 xmlns:xlink="http://www.w3.org/1999/xlink">intra 0.05±0.00, respectively, for N=256 network. These correspond expected Hamming distance 102.4 bits response. Moreover, simple cherry-picking scheme discards noisy yields <; 0.01 while still retaining ~ 200 bits/response (corresponding 80 bits/response). addition characterizing reliability, demonstrate super-exponential scaling in up N=512 PUFmeter, recent analysis tool, unable model our PUF. Finally, characterize temperature variation HBN-PUF propose future improvements.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Authentication Schemes based on Physically Unclonable Functions

In this project we investigate di erent hardware authentication schemes based on Physically Unclonable Functions. We start by analyzing the concepts of a fuzzy extractor and a secure sketch from an information-theoretic perspective. We then present a hardware implementation of a fuzzy extractor which uses the code o set construction with BCH codes. Finally, we propose a new cryptographic protoc...

متن کامل

Robust Authentication Using Physically Unclonable Functions

In this work we utilize a physically unclonable function (PUF) to improve resilience of authentication protocols to various types of compromise. As an example application, we consider users who authenticate at an ATM using their bank-issued PUF and a password. We present a scheme that is provably secure and achieves strong security properties. In particular, we ensure that (i) the user is unabl...

متن کامل

Hardware Intrinsic Security from Physically Unclonable Functions

Counterfeiting of goods in general and of electronic goods in particular is a growing concern with a huge impact on the global economy, the society, and the security of its critical infrastructure. Various examples are known where companies suffer from economic and brand damage due to competition with counterfeit goods. In some cases the use of counterfeit components has even led to tragic acci...

متن کامل

Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions

Physical attacks on cryptographic implementations and devices have become crucial. In this context a recent line of research on a new class of side-channel attacks, called memory attacks, has received increasingly more attention. These attacks allow an adversary to measure a significant fraction of secret key bits directly from memory, independent of any computational side-channels. Physically ...

متن کامل

On the Key Generation Rate of Physically Unclonable Functions

THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. In this paper, an algebraic binning based coding scheme and its associated achievable rate for key generation using physically unclonable functions (PUFs) is determined. This achievable rate is shown to be optimal under the generated-secret (GS) model for PUFs. Furthermore, a polar code based polynomial-time encoding and decoding scheme that a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3066948