Skip to content

LAKSHMAN1410/PUF-for-Secure-Hardware-Authentication-FPGA-ASIC-Implementation-

Folders and files

NameName
Last commit message
Last commit date

Latest commit

ย 

History

18 Commits
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 

Repository files navigation

๐Ÿ” DESIGN AND DEVELOPMENT OF A PHYSICAL UNCLONABLE FUNCTION (PUF) FOR HARDWARE SECURITY

๐Ÿ“– Overview

This project presents the design, implementation, evaluation, and ASIC synthesis of a Hybrid XOR-Based Arbiter Physical Unclonable Function (PUF) for secure hardware authentication.

The system leverages intrinsic silicon manufacturing variations to generate unique, device-specific digital fingerprints, eliminating the need for stored cryptographic keys.

The proposed architecture is:

  • โœ… Implemented on Basys-3 FPGA (Xilinx Artix-7)
  • โœ… Evaluated using statistical performance metrics
  • โœ… Integrated with UART-based challengeโ€“response protocol
  • โœ… Synthesized for ASIC (180nm CMOS) using Cadence Genus
  • โœ… Designed for IoT and resource-constrained systems

๐Ÿง  What is a PUF?

A Physical Unclonable Function (PUF) is a hardware security primitive that generates unique responses based on uncontrollable manufacturing variations in integrated circuits.

For a given challenge:

  • Same device โ†’ Same response
  • Different device โ†’ Different response

This property makes PUFs ideal for:

  • Device authentication
  • Secure key generation
  • Hardware root-of-trust
  • Anti-counterfeiting systems

๐Ÿ—๏ธ Implemented Architectures

This project implements and evaluates multiple PUF variants:

  • Basic Arbiter PUF
  • XOR Arbiter PUF
  • 16-Bit XOR Arbiter PUF
  • MUXโ€“DEMUX Arbiter PUF
  • Proposed Hybrid Architecture (Improved Reliability)

๐Ÿš€ Proposed 16-Bit XOR Arbiter PUF

Architecture Features

  • 16-bit challenge input
  • 8 parallel Arbiter chains
  • XOR-combined final response
  • Modular design
  • UART interface (9600 baud)

Why XOR?

Standard Arbiter PUF is linear and vulnerable to machine learning attacks.

XOR-based architecture:

  • Introduces non-linearity
  • Improves entropy
  • Enhances unpredictability
  • Increases resistance to modeling attacks

Trade-off:

  • Slight reliability reduction under environmental variation.

๐Ÿ”„ Authentication Protocol

1๏ธโƒฃ Enrollment Phase

  • 256 challenges applied
  • CRPs collected via UART
  • Stored in CSV database
  • Reference fingerprint created

2๏ธโƒฃ Authentication Phase

  • Same 256 challenges re-applied
  • Responses compared
  • Match threshold: โ‰ฅ 240 / 256

If threshold satisfied โ†’ โœ… Authenticated Else โ†’ โŒ Authentication Failed

This threshold accounts for environmental noise and voltage variation.


๐Ÿ“Š Performance Analysis

Performance is evaluated using:

  • Uniformity
  • Uniqueness (HDinter)
  • Randomness (Entropy)
  • Reliability (HDintra)

Measured Results

Architecture Uniformity Uniqueness Randomness
Arbiter PUF 99.4% 0% 67%
XOR PUF 98.8% 30.21% 44.21%
16-Bit XOR PUF 98.8% 35.44% 49.5%

Key Observations

  • XOR improves uniqueness significantly.
  • Hybrid design improves statistical balance.
  • Reliability depends on delay margin stability.

๐Ÿ“ธ FPGA Implementation Results

Hardware validation of PUF architecture on Basys-3 FPGA board.

image

๐Ÿ“Š Performance Analysis & Mathematical Formulation

Performance of the implemented PUF architectures is evaluated using four primary metrics:

  • Uniformity
  • Uniqueness (HDinter)
  • Randomness (Entropy)
  • Reliability (HDintra)

1๏ธโƒฃ Uniformity

Uniformity measures the balance between 0s and 1s in the response bits.

Ideal Value โ†’ 50%

If the response is biased toward 0 or 1, the PUF becomes predictable.

Formula:

[ Uniformity_a = \frac{1}{n} \sum_{b=1}^{n} r_{a,b} \times 100% ]

Where:

  • ( n ) = number of response bits
  • ( r_{a,b} ) = b-th bit of response from chip a

Interpretation:

  • 50% โ†’ Perfect balance
  • 50% or <50% โ†’ Bias present


2๏ธโƒฃ Uniqueness (Inter-Chip Hamming Distance โ€“ HDinter)

Uniqueness evaluates how different responses are between different chips when the same challenge is applied.

Ideal Value โ†’ 50%

Formula:

[ Uniqueness = \frac{2}{k(k-1)} \sum_{a=1}^{k-1} \sum_{b=a+1}^{k} \frac{HD(Q_a, Q_b)}{n} \times 100% ]

Where:

  • ( k ) = number of chips
  • ( Q_a, Q_b ) = n-bit responses of chip a and b
  • ( HD(Q_a, Q_b) ) = Hamming Distance
  • ( n ) = number of response bits

Interpretation:

  • 50% โ†’ Perfect uniqueness
  • <50% โ†’ Devices too similar
  • 50% โ†’ Excessive variation


3๏ธโƒฃ Randomness (Entropy)

Randomness measures unpredictability of PUF responses.

High entropy means responses cannot be predicted.

Formula:

[ H_n = -\log_2 \left( \max(p_n, 1 - p_n) \right) ]

Where:

  • ( p_n ) = probability of occurrence of bit โ€˜1โ€™
  • ( 1 - p_n ) = probability of bit โ€˜0โ€™

Interpretation:

  • Maximum entropy when ( p_n = 0.5 )
  • Lower entropy indicates bias

4๏ธโƒฃ Reliability (Intra-Chip Hamming Distance โ€“ HDintra)

Reliability measures consistency of the same device under environmental variations (temperature, voltage).

Ideal Value โ†’ 100%

Step 1: Compute HDintra

[ HD_{INTRA_i} = \frac{1}{s} \sum_{t=1}^{s} \frac{HD(Q_i, Q_{i,t})}{n} \times 100% ]

Where:

  • ( Q_i ) = reference response
  • ( Q_{i,t} ) = response under variation
  • ( s ) = number of measurements
  • ( n ) = number of bits

Step 2: Reliability

[ Reliability_i = 100% - HD_{INTRA_i} ]

Interpretation:

  • 100% โ†’ Perfect stability
  • Lower value โ†’ Bit flips occurring

๐Ÿ“ˆ Summary of Ideal Values

Metric Ideal Value
Uniformity 50%
Uniqueness 50%
Randomness Maximum entropy
Reliability 100%

๐Ÿงฎ ASIC Synthesis Results (Area, Power & Timing)

Technology

  • Node: 180nm CMOS
  • Tool: Cadence Genus
  • Standard Cell Library: tsl18fs120
  • Timing Corner: Slow-Slow (SS)

Flow

RTL โ†’ Elaboration โ†’ Generic Synthesis โ†’ Mapping โ†’ Optimization โ†’ Netlist โ†’ SDF โ†’ Reports

Why ASIC?

FPGA ASIC
Reconfigurable Permanent layout
Higher static power Lower leakage
Bitstream attack risk Physically fixed
Prototype-friendly Production secure

ASIC provides stronger unclonability and power efficiency for IoT deployment.

(Add synthesis report summary here:)

  • Total Area
  • Gate Count
  • Leakage Power
  • Dynamic Power
  • Timing Slack

๐Ÿ“‚ Project Structure

/rtl
    arbiter_stage.v
    arbiter_cell.v
    xor_puf.v
    top_module.v

/uart
    uart_tx.v
    uart_rx.v

/synthesis
    genus_script.tcl
    constraints.sdc

/results
    performance_metrics.xlsx
    synthesis_reports/

/docs
    PUF_Final_Report.pdf

๐Ÿ” Security Features

  • No secret key storage
  • Hardware-based device fingerprint
  • Resistant to cloning
  • XOR-based non-linearity
  • Threshold-based authentication robustness
  • ASIC-level physical immutability

โš ๏ธ Limitations

  • Environmental sensitivity (temperature/voltage)
  • XOR increases delay instability
  • CRP exposure may enable ML modeling
  • No integrated ECC yet

๐Ÿ”ฎ Future Work

  • Error Correction Code (ECC) integration
  • Machine learning attack evaluation
  • Strong PUF enhancement
  • On-chip key extraction module
  • Low-power ASIC optimization
  • Full tape-out ready design

About

Design and implementation of a hybrid XOR-based Arbiter Physical Unclonable Function (PUF) on FPGA, followed by ASIC synthesis , enabling lightweight and secure hardware authentication with enhanced uniqueness, entropy, and reliability.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors