Statistical Quality Comparison of the Bitstrings Generated by a Physical Unclonable Function across Xilinx, Altera and Microsemi Devices

• URL: http://arxiv.org/abs/2408.06463v1
• Date: Mon, 12 Aug 2024 19:28:57 GMT
• Title: Statistical Quality Comparison of the Bitstrings Generated by a Physical Unclonable Function across Xilinx, Altera and Microsemi Devices
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Entropy or randomness represents a foundational security property in security-related operations, such as key generation. Key generation in turn is central to security protocols such as authentication and encryption. Physical unclonable functions (PUF) are hardware-based primitives that can serve as key generation engines in modern microelectronic devices and applications. PUFs derive entropy from manufacturing variations that exist naturally within and across otherwise identical copies of a device. However, the levels of random variations that represent entropy, which are strongly correlated to the quality of the PUF-generated bitstrings, vary from one manufacturer to another. In this paper, we evaluate entropy across a set of devices manufactured by three mainstream FPGA vendors, Xilinx, Altera and Microsemi. The devices selected for evaluation are considered low-end commercial devices to make the analysis relevant to IoT applications. The SiRF PUF is used in the evaluation, and is constructed nearly identically across the three vendor devices, setting aside minor differences that exist in certain logic element primitives used within the PUF architecture, and which have only a minor impact on our comparative analysis. The SiRF PUF uses a high-resolution time-to-digital converter (TDC) crafted from high-speed carry-chain logic embedded within each device to measure path delays in an engineered netlist of logic gates as a source of entropy. Therefore, our analysis includes an evaluation of actual path delay variation as it exists across the three device classes, as well as a statistical evaluation of the PUF-generated bitstrings. A reliablity analysis is also provided using data collected in industrial-standard temperature experiments to round out the evaluation of important statistical properties of the PUF.

Related papers

• A Unified Open-Set Framework for Scalable PUF-Based Authentication of Heterogeneous IoT Devices [13.17300268210473]
  This paper proposes a scalable, helper-data-free, open-set PUF authentication framework to manage heterogeneous fleets of IoT devices.<n>Our framework achieves 100% closed-set accuracy and near-zero open-set error rates with up to 45 devices.<n> Prototyped on a Raspberry Pi, our framework completes one authentication cycle within 0.67 s, approximately 30x faster than the state-of-the-art open-set baselines.
  arXiv  Detail & Related papers  (2026-05-08T06:46:41Z)
• Univariate Channel Fusion for Multivariate Time Series Classification [45.88028371034407]
  We propose the Univariate Channel Fusion (UCF) method to deal with MTSC efficiently.<n>We evaluate UCF in five case studies covering diverse application domains, including chemical monitoring, brain-computer interfaces, and human activity analysis.<n>The results demonstrate that UCF often outperforms baseline methods and state-of-the-art algorithms tailored for MTSC.
  arXiv  Detail & Related papers  (2026-04-17T14:54:18Z)
• InterPUF: Distributed Authentication via Physically Unclonable Functions and Multi-party Computation for Reconfigurable Interposers [0.25489046505746704]
  InterPUF is a compact and scalable authentication framework that transforms the interposer into a distributed root of trust.<n>Our hardware evaluation shows only 0.23% area and 0.072% power overhead across diverse chiplets.
  arXiv  Detail & Related papers  (2026-01-16T15:26:07Z)
• Adaptive Variation-Resilient Random Number Generator for Embedded Encryption [7.239794172995]
  We present an adaptive variation-resilient RNG capable of extracting unbiased encryption-grade random number streams from physically driven entropy sources.<n>The generated unbiased bit streams, due to their higher entropy, then only need to undergo simplified post-processing.
  arXiv  Detail & Related papers  (2025-07-07T22:42:49Z)
• 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)
• PaTH Attention: Position Encoding via Accumulating Householder Transformations [56.32365080761523]
  PaTH is a flexible data-dependent position encoding scheme based on accumulated products of Householder transformations.<n>We derive an efficient parallel algorithm for training through exploiting a compact representation of products of Householder matrices.
  arXiv  Detail & Related papers  (2025-05-22T08:36:09Z)
• 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)
• Device-independent secure correlations in sequential quantum scenarios [44.99833362998488]
  Device-independent quantum information is attracting significant attention, particularly for its applications in information security.<n>We propose a systematic approach to designing sequential quantum protocols for device-independent security.<n>We analytically prove that, with this systematic construction, the resulting ideal correlations are secure in the sense that they cannot be reproduced as a statistical mixture of other correlations.
  arXiv  Detail & Related papers  (2025-03-18T16:45:20Z)
• PCF-Lift: Panoptic Lifting by Probabilistic Contrastive Fusion [80.79938369319152]
  We design a new pipeline coined PCF-Lift based on our Probabilis-tic Contrastive Fusion (PCF) Our PCF-lift not only significantly outperforms the state-of-the-art methods on widely used benchmarks including the ScanNet dataset and the Messy Room dataset (4.4% improvement of scene-level PQ)
  arXiv  Detail & Related papers  (2024-10-14T16:06:59Z)
• Designing Short-Stage CDC-XPUFs: Balancing Reliability, Cost, and Security in IoT Devices [2.28438857884398]
  Physically Unclonable Functions (PUFs) generate unique cryptographic keys from inherent hardware variations. Traditional PUFs like Arbiter PUFs (APUFs) and XOR Arbiter PUFs (XOR-PUFs) are susceptible to machine learning (ML) and reliability-based attacks. We propose an optimized CDC-XPUF design that incorporates a pre-selection strategy to enhance reliability and introduces a novel lightweight architecture.
  arXiv  Detail & Related papers  (2024-09-26T14:50:20Z)
• A Physical Layer Analysis of Entropy in Delay-Based PUFs Implemented on FPGAs [3.1545591628790572]
  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.
  arXiv  Detail & Related papers  (2024-09-01T19:46:03Z)
• 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)
• Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement [45.386403865847235]
  Physical Unclonable Functions (PUFs) leverage inherent, non-clonable physical randomness to generate unique input-output pairs.<n>Quantum PUFs (QPUFs) extend this concept by using quantum states as input-output pairs.<n>We show that random unitary QPUFs cannot achieve existential unforgeability against Quantum Polynomial Time adversaries.<n>We introduce a second model where the QPUF functions as a nonunitary quantum channel, which guarantees existential unforgeability.
  arXiv  Detail & Related papers  (2024-04-17T12:16:41Z)
• PhenoAuth: A Novel PUF-Phenotype-based Authentication Protocol for IoT Devices [9.608432807038083]
  This work proposes a full noise-tolerant authentication protocol based on the PUF Phenotype concept. It demonstrates mutual authentication and forward secrecy in a setting suitable for device-to-device communication.
  arXiv  Detail & Related papers  (2024-03-06T06:04:32Z)
• A Generative Approach for Production-Aware Industrial Network Traffic Modeling [70.46446906513677]
  We investigate the network traffic data generated from a laser cutting machine deployed in a Trumpf factory in Germany. We analyze the traffic statistics, capture the dependencies between the internal states of the machine, and model the network traffic as a production state dependent process. We compare the performance of various generative models including variational autoencoder (VAE), conditional variational autoencoder (CVAE), and generative adversarial network (GAN)
  arXiv  Detail & Related papers  (2022-11-11T09:46:58Z)
• A 3.3 Gbps SPAD-Based Quantum Random Number Generator [0.4189768681039651]
  We discuss theory on the quantum random flip-flop (QRFF), which elucidates the role of circuit imperfections that manifest themselves in bias and correlation. A novel transistor implementation of the QRFF circuit is presented, which enables compensation of the degradation in entropy inherent to the finite non-symmetric transitions of the random flip-flop. A full system containing two independent arrays of the QRFF circuit is manufactured and tested in a 55 nm Bipolar-CMOS-DMOS technology node.
  arXiv  Detail & Related papers  (2022-09-11T13:56:57Z)
• Evaluating Short-Term Forecasting of Multiple Time Series in IoT Environments [67.24598072875744]
  Internet of Things (IoT) environments are monitored via a large number of IoT enabled sensing devices. To alleviate this issue, sensors are often configured to operate at relatively low sampling frequencies. This can hamper dramatically subsequent decision-making, such as forecasting.
  arXiv  Detail & Related papers  (2022-06-15T19:46:59Z)
• FAMLP: A Frequency-Aware MLP-Like Architecture For Domain Generalization [73.41395947275473]
  We propose a novel frequency-aware architecture, in which the domain-specific features are filtered out in the transformed frequency domain. Experiments on three benchmarks demonstrate significant performance, outperforming the state-of-the-art methods by a margin of 3%, 4% and 9%, respectively.
  arXiv  Detail & Related papers  (2022-03-24T07:26:29Z)
• Quality of Service Guarantees for Physical Unclonable Functions [90.99207266853986]
  noisy physical unclonable function (PUF) outputs facilitate reliable, secure, and private key agreement. We introduce a quality of service parameter to control the percentage of PUF outputs for which a target reliability level can be guaranteed.
  arXiv  Detail & Related papers  (2021-07-12T18:26:08Z)
• Efficient Construction of Quantum Physical Unclonable Functions with Unitary t-designs [1.7403133838762446]
  We study the noise-resilience of QPUF_t against specific types of noise, unitary noise, and show that some resilience can be achieved. To make the noise-resilience more realistic and meaningful, we conclude that some notion of error mitigation or correction should be introduced.
  arXiv  Detail & Related papers  (2021-01-14T16:14: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.