A Physical Layer Analysis of Entropy in Delay-Based PUFs Implemented on FPGAs

• URL: http://arxiv.org/abs/2409.00825v1
• Date: Sun, 1 Sep 2024 19:46:03 GMT
• Title: A Physical Layer Analysis of Entropy in Delay-Based PUFs Implemented on FPGAs
• Authors: Jim Plusquellic, Jennifer Howard, Ross MacKinnon, Kristianna Hoffman, Eirini Eleni Tsiropoulou, Calvin Chan,
• Abstract summary: Physical Unclonable Functions (PUFs) leverage signal variations that occur within the device as a source of entropy. On-chip instrumentation is utilized by some PUF architectures to measure and digitize these variations. In this paper, we apply statistical averaging and differencing techniques to derive estimates for the delay variation associated with an FPGA's basic components.
• Score: 3.1545591628790572
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Physical Unclonable Functions (PUFs) leverage signal variations that occur within the device as a source of entropy. On-chip instrumentation is utilized by some PUF architectures to measure and digitize these variations, which are then processed into bitstrings and secret keys for use in security functions such as authentication and encryption. In many cases, the variations in the measured signals are introduced by a sequence of components in the circuit structure defined by the PUF architecture. In particular, the Hardware-Embedded deLay PUF (HELP) measures delay variations that occur in combinational logic paths on Field Programmable Gate Arrays (FPGAs), which are composed of a set of interconnecting wires (nodes) and look-up tables (LUTs). Previous investigations of variations in these path delays show that it is possible to derive high quality bitstrings, i.e., those which exhibit high levels of uniqueness and randomness across the device population. However, the underlying source and level of variations associated with the constituent components of the paths remain unknown. In this paper, we apply statistical averaging and differencing techniques to derive estimates for the delay variation associated with an FPGA's basic components, namely LUTs and nodes, as a means of fully characterizing the PUF's source of entropy. The analysis is carried out on a set of 50,015 path delay measurements collected from a set of 20 Xilinx Zynq 7020 SoC-class FPGAs, on which 25 identical instances of a functional unit are instantiated, for a total of 500 instances.

Related papers

• Lightweight Fault Detection Architecture for NTT on FPGA [0.8793721044482612]
  Post-Quantum Cryptographic (PQC) algorithms are mathematically secure and resistant to quantum attacks.<n>They can still leak sensitive information in hardware implementations due to natural faults or intentional fault injections.<n>This research proposes a lightweight, efficient, recomputation-based fault detection module.
  arXiv  Detail & Related papers  (2025-08-05T04:23:50Z)
• DNN-Based Precoding in RIS-Aided mmWave MIMO Systems With Practical Phase Shift [56.04579258267126]
  This paper investigates maximizing the throughput of millimeter wave (mmWave) multiple-input multiple-output (MIMO) systems with obstructed direct communication paths.<n>A reconfigurable intelligent surface (RIS) is employed to enhance transmissions, considering mmWave characteristics related to line-of-sight (LoS) and multipath effects.<n>Deep neural network (DNN) is developed to facilitate faster codeword selection.
  arXiv  Detail & Related papers  (2025-07-03T17:35:06Z)
• A TRNG Implemented using a Soft-Data Based Sponge Function within a Unified Strong PUF Architecture [0.0]
  We propose a unified PUF-TRNG architecture that leverages a combination of the static entropy available in a strong PUF.<n>A novel data postprocessing algorithm is proposed based on a modified duplex sponge construction.<n>Results indicate a stable and robust TRNG design with excellent min-entropy and a moderate data rate.
  arXiv  Detail & Related papers  (2025-06-21T19:23:17Z)
• Fast and Robust Speckle Pattern Authentication by Scale Invariant Feature Transform algorithm in Physical Unclonable Functions [1.0319299382223166]
  We present a metric-independent authentication approach that leverages the Scale Invariant Feature Transform (SIFT) algorithm. The authentication process is highly reliable even in presence of response rotation, zooming, and cropping. This work broadens the applicability and reliability of PUF to practical high-security authentication or merchandise anti-counterfeiting.
  arXiv  Detail & Related papers  (2025-04-28T11:36:04Z)
• Statistical Quality Comparison of the Bitstrings Generated by a Physical Unclonable Function across Xilinx, Altera and Microsemi Devices [0.0]
  We evaluate entropy across a set of devices manufactured by three mainstream FPGA vendors, Xilinx, Altera and Microsemi. The SiRF PUF is used in the evaluation, and is constructed nearly identically across the three vendor devices.
  arXiv  Detail & Related papers  (2024-08-12T19:28:57Z)
• AdaLog: Post-Training Quantization for Vision Transformers with Adaptive Logarithm Quantizer [54.713778961605115]
  Vision Transformer (ViT) has become one of the most prevailing fundamental backbone networks in the computer vision community. We propose a novel non-uniform quantizer, dubbed the Adaptive Logarithm AdaLog (AdaLog) quantizer.
  arXiv  Detail & Related papers  (2024-07-17T18:38:48Z)
• fSEAD: a Composable FPGA-based Streaming Ensemble Anomaly Detection Library [1.8570740863168362]
  Machine learning ensembles combine multiple base models to produce a more accurate output. We propose a flexible computing architecture consisting of multiple partially reconfigurable regions, pblocks, which each implement anomaly detectors. Our proof-of-concept design supports three state-of-the-art anomaly detection algorithms: Loda, RS-Hash and xStream.
  arXiv  Detail & Related papers  (2024-06-10T03:38:35Z)
• CycPUF: Cyclic Physical Unclonable Function [1.104960878651584]
  We introduce feedback signals into traditional delay-based PUF designs to give them a wider range of possible output behaviors. Based on our analysis, cyclic PUFs produce responses that can be binary, steady-state, oscillating, or pseudo-random under fixed challenges. The security gain of the proposed cyclic PUFs is also shown against state-of-the-art attacks.
  arXiv  Detail & Related papers  (2024-02-12T22:04:04Z)
• Quantum Fourier Transformation Circuits Compilation [7.1069624340204465]
  This research paper focuses on the domain-specific hardware mapping strategy for Quantum Transformation (QFT) circuits. We adopt a novel approach that combines technical intuition, often referred to as "educated guesses," and sophisticated synthesis program tools. The groundbreaking outcome of our research is the introduction of the first set of linear-depth transformed QFT circuits designed for Google Sycamore, IBM heavy-hex, and the conventional 2-dimensional (2D) grid configurations.
  arXiv  Detail & Related papers  (2023-12-17T21:26:17Z)
• Deep Learning Assisted Multiuser MIMO Load Modulated Systems for Enhanced Downlink mmWave Communications [68.96633803796003]
  This paper is focused on multiuser load modulation arrays (MU-LMAs) which are attractive due to their low system complexity and reduced cost for millimeter wave (mmWave) multi-input multi-output (MIMO) systems. The existing precoding algorithm for downlink MU-LMA relies on a sub-array structured (SAS) transmitter which may suffer from decreased degrees of freedom and complex system configuration. In this paper, we conceive an MU-LMA system employing a full-array structured (FAS) transmitter and propose two algorithms accordingly.
  arXiv  Detail & Related papers  (2023-11-08T08:54:56Z)
• SPAIC: A sub-$\mu$W/Channel, 16-Channel General-Purpose Event-Based Analog Front-End with Dual-Mode Encoders [6.6017549029623535]
  Low-power event-based analog front-ends are crucial to build efficient neuromorphic processing systems. We present a novel, highly analog front-end chip, denoted as SPAIC (signal-to-spike converter for analog AI computation) It offers a general-purpose dual-mode analog signal-to-spike encoding with delta modulation and pulse frequency modulation, with tunable frequency bands.
  arXiv  Detail & Related papers  (2023-08-31T19:53:04Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Accelerating Wireless Federated Learning via Nesterov's Momentum and Distributed Principle Component Analysis [59.127630388320036]
  A wireless federated learning system is investigated by allowing a server and workers to exchange uncoded information via wireless channels. Since the workers frequently upload local to the server via bandwidth-limited channels, the uplink transmission from the workers to the server becomes a communication bottleneck. A one-shot distributed principle component analysis (PCA) is leveraged to reduce the dimension of the dimension of the communication bottleneck.
  arXiv  Detail & Related papers  (2023-03-31T08:41:42Z)
• Proximal Policy Optimization-based Transmit Beamforming and Phase-shift Design in an IRS-aided ISAC System for the THz Band [90.45915557253385]
  IRS-aided integrated sensing and communications (ISAC) system operating in the terahertz (THz) band is proposed to maximize the system capacity. Transmit beamforming and phase-shift design are transformed into a universal optimization problem with ergodic constraints.
  arXiv  Detail & Related papers  (2022-03-21T09:15:18Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.