Machine Learning Modeling Attacks on Physical Unclonable Functions

145 concepts65 papers2 proposals

Physical Unclonable Functions (PUFs) serve as the hardware equivalent of a human fingerprint. Instead of storing a cryptographic key in vulnerable non-volatile memory, a PUF leverages microscopic, unavoidable manufacturing variations in silicon to generate unique cryptographic secrets on the fly. When a PUF is given an input (a challenge), it routes signals through these randomized physical structures to produce an output (a response).

Because these physical variations are completely random and unique to each chip, a PUF is theoretically impossible to clone physically. However, security primitives often suffer from a critical vulnerability: while the physical structure cannot be cloned, the mathematical relationship between the challenges and responses can often be learned. This is the core of a machine learning modeling attack.

Why Modeling Attacks Work

The vulnerability to modeling attacks stems from a gap between physical complexity and mathematical simplicity. An adversary intercepts a subset of challenge-response pairs (CRPs) transmitted over an insecure channel. If the underlying circuit architecture maps inputs to outputs through a predictable mathematical structure, machine learning models can easily reverse-engineer that mapping.

Consider a standard delay-based Arbiter PUF. It feeds a signal through a series of multiplexer stages configured by the challenge bits. The final response depends on which of two parallel paths is faster. While the exact delay of each individual stage is a random artifact of manufacturing, the total delay experienced by the signal is simply a linear combination of those stage delays.

Because this relationship is fundamentally linear, an attacker does not need to guess the exact physical properties of the chip. Instead, they can treat the circuit as a linear classification problem. As discussed by Mehrdad Majzoobi et al. in Automated Design, Implementation, and Evaluation of Arbiter-based PUF on FPGA using Programmable Delay Lines, linear delay-based authentication mechanisms are highly vulnerable to predictive modeling.

Once an adversary collects enough data points, optimization techniques can quickly converge on a solution. Carlos A. Coello Coello et al. demonstrated in Modeling Strong Physically Unclonable Functions with Metaheuristics that evolutionary and metaheuristic algorithms can highly accurately predict responses given a sufficient dataset of CRPs. As noted by Yansong Gao et al. in A Challenge Obfuscation Method for Thwarting Model Building Attacks on PUFs, a successful model-building attack allows an attacker to construct a "software clone" of the physical security module, rendering its physical uniqueness entirely obsolete.

[Challenge Input] ---> [ Physical PUF Circuit ] ---> [ Intercepted Responses ]
                                                              |
                                                              v
                                                   [ Machine Learning Model ]
                                                              |
                                                              v
                                                   [ Digital Software Clone ]

Expanding the Attack Surface: Side Channels and Sensors

Modeling attacks are not restricted to digital challenge-response interfaces. Attackers can augment their datasets with physical side channels to break architectures previously thought to be secure. For instance, Ulrich Rührmair et al. showed in Power and Timing Side Channels for PUFs and their Efficient Exploitation that monitoring power consumption and timing signatures allows adversaries to model highly parallelized and complex PUF configurations in practical timeframes.

This predictive vulnerability extends beyond silicon logic to analog and physical-layer identification systems:

Designing for Machine Learning Resilience

To defeat modeling attacks, hardware designers must break the mathematical predictability that machine learning models exploit. If the relationship between the challenge and the response cannot be represented as a smooth, learnable function, the attack fails.

Introducing Non-Linearity and Recurrent Feedback

One approach is to inject high degrees of non-linearity into the circuit architecture. By feeding previous outputs back into the system as inputs, designers can create complex temporal dependencies. Rohit Abraham John et al. utilized this mechanism in Halide perovskite memristors as flexible and reconfigurable physical unclonable functions, demonstrating that recurrent feedback loops create non-linear dependencies that make the challenge-response relationship statistically indistinguishable from random noise to an outside observer.

Shifting to Stochastic and Probabilistic Physics

Instead of measuring static physical properties (like wire delays), newer architectures derive entropy from dynamic, probabilistic quantum or thermodynamic phenomena.

In A Probability-Based Strong Physical Unclonable Function With Strong Machine Learning Immunity, Zezhong Tu et al. introduced a design that leverages the stochastic charge emission probabilities of electron traps in transistors. Because the output is fundamentally probabilistic rather than a deterministic function of the input, standard machine learning regression models cannot converge on a predictive mapping. Similarly, Taixin Li et al. demonstrated in Demonstration of high-reconfigurability and low-power strong physical unclonable function empowered by FeFET cycle-to-cycle variation and charge-domain computing that leveraging cycle-to-cycle stochasticity in ferroelectric field-effect transistors prevents adversaries from building accurate predictive models, even when they have access to massive datasets of responses.

From a theoretical standpoint, these defenses align with the limits of predictability in hardware security interfaces. As Chenglu Jin demonstrated in A Theoretical Framework for the Analysis of Physical Unclonable Function Interfaces and its Relation to the Random Oracle Model, high-entropy cryptographic security can still be successfully extracted from physical devices even if an adversary can predict individual response bits with partial accuracy, provided that the physical mechanism prevents that prediction from becoming perfect.

Key Foundational Work

Modeling attacks on physical unclonable functions (2010) — contributed 6 concept elements to this direction.
Modeling attacks on physical unclonable functions (2010) — contributed 6 concept elements to this direction.
History & citationVersion 2 · 2026-10-04

Current · Permanent link

  1. Version 2 (latest) · 2026-10-04 · 67 papers
  2. Version 1 · 2026-10-04 · 66 papers
Cite this direction

Latest version (a living page):

@misc{lacuna_machine_learning_modeling_attacks_e5d78244,
  title = {machine learning modeling attacks},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/machine-learning-modeling-attacks/rdr_e5d7824420d44870b149f97cc4ad325b},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}

This exact version (version 2, frozen text):

@misc{lacuna_machine_learning_modeling_attacks_e5d78244_v2,
  title = {machine learning modeling attacks},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/machine-learning-modeling-attacks/rdr_e5d7824420d44870b149f97cc4ad325b/v/2},
  note = {Version 2, frozen 2026-10-04. Accessed 2026-11-22},
}
About

These directions overlap with this one through shared papers.

See something wrong? Report a mistake