首页/论文/2004.01872

arXiv 2004.018722020-04-04eess.SPcs.CRcs.ITcs.MMmath.IT

Low-complexity and Reliable Transforms for Physical Unclonable Functions

Onur Günlü, Rafael F. Schaefer

备注：: To appear in IEEE International Conference on Acoustics, Speech, and Signal Processing 2020

英文摘要：

Noisy measurements of a physical unclonable function (PUF) are used to store secret keys with reliability, security, privacy, and complexity constraints. A new set of low-complexity and orthogonal transforms with no multiplication is proposed to obtain bit-error probability results significantly better than all methods previously proposed for key binding with PUFs. The uniqueness and security performance of a transform selected from the proposed set is shown to be close to optimal. An error-correction code with a low-complexity decoder and a high code rate is shown to provide a block-error probability significantly smaller than provided by previously proposed codes with the same or smaller code rates.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Secret Key Agreement with Physical Unclonable Functions: An Optimality Summary

Technische Universität Berlin（柏林工业大学）

We address security and privacy problems for digital devices and biometrics from an information-theoretic optimality perspective, where a secret key is generated for authentication, identification, message encryption/decryption, or secure computations. A physical unclonable function (PUF) is a promising solution for local security in digital devices and this review gives the most relevant summary for information theorists, coding theorists, and signal processing community members who are interested in optimal PUF constructions. Low-complexity signal processing methods such as transform coding …

2020-12-16cs.CRcs.CVcs.IT

Secure and Reliable Key Agreement with Physical Unclonable Functions

Different transforms used in binding a secret key to correlated physical-identifier outputs are compared. Decorrelation efficiency is the metric used to determine transforms that give highly-uncorrelated outputs. Scalar quantizers are applied to transform outputs to extract uniformly distributed bit sequences to which secret keys are bound. A set of transforms that perform well in terms of the decorrelation efficiency is applied to ring oscillator (RO) outputs to improve the uniqueness and reliability of extracted bit sequences, to reduce the hardware area and information leakage about the key…

2020-02-27cs.CRcs.ITeess.IV

Quality of Service Guarantees for Physical Unclonable Functions

University of Siegen（锡根大学）；Princeton University（普林斯顿大学）

We consider a secret key agreement problem in which noisy physical unclonable function (PUF) outputs facilitate reliable, secure, and private key agreement with the help of public, noiseless, and authenticated storage. PUF outputs are highly correlated, so transform coding methods have been combined with scalar quantizers to extract uncorrelated bit sequences with reliability guarantees. For PUF circuits with continuous-valued outputs, the models for transformed outputs are made more realistic by replacing the fitted distributions with corresponding truncated ones. The state-of-the-art PUF met…

2021-10-11cs.CRcs.ITcs.LG

用于物理不可克隆函数的串行极化自同构集成译码器

Serial Polar Automorphism Ensemble Decoders for Physical Unclonable Functions

针对物理不可克隆函数，提出基于极化码和串行自同构集成译码的低复杂度编码方案，重用单个SC译码器，以3比特量化实现$10^{-6}$误码率，码字比特数较BCH基线减少1.75倍。

2025-10-10cs.ITeess.SPmath.IT

Low-Complexity Linear Equalizers for OTFS Exploiting Two-Dimensional Fast Fourier Transform

Orthogonal time frequency space (OTFS) modulation can effectively convert a doubly dispersive channel into an almost non-fading channel in the delay-Doppler domain. However, one critical issue for OTFS is the very high complexity of equalizers. In this letter, we first reveal the doubly block circulant feature of OTFS channel represented in the delay-Doppler domain. By exploiting this unique feature, we further propose zero-forcing (ZF) and minimum mean squared error (MMSE) equalizers that can be efficiently implemented with the two-dimensional fast Fourier transform. The complexity of our pro…

2019-09-02cs.ITeess.SPmath.IT

交织块稀疏变换

Interleaved Block-Sparse Transform

本文提出交织块稀疏变换及相应的跨域记忆近似消息传递估计器，以降低大规模变换的硬件实现复杂度，并在压缩感知与交织频分复用系统中验证了其优异性能。

2024-07-18cs.ITeess.SPmath.IT

更多相关论文收起更多论文

基于分数傅里叶变换的低复杂度色散与时间/频率偏移联合估计

Low Complexity Joint Chromatic Dispersion and Time/Frequency Offset Estimation Based on Fractional Fourier Transform

提出基于分数傅里叶变换的色散与时间-频率偏移联合估计方法，实验验证其计算复杂度降低超50%且精度不变。

2024-11-07eess.SP

A Multiparametric Class of Low-complexity Transforms for Image and Video Coding

Universidade de São Paulo（圣保罗大学）；Universidade Federal de Pernambuco（伯南布哥联邦大学）；Universidade Federal do Rio Grande（里奥格兰德联邦大学）；Universidade Federal de Santa Maria（圣玛丽亚联邦大学）；University of Calgary（卡尔加里大学）

Discrete transforms play an important role in many signal processing applications, and low-complexity alternatives for classical transforms became popular in recent years. Particularly, the discrete cosine transform (DCT) has proven to be convenient for data compression, being employed in well-known image and video coding standards such as JPEG, H.264, and the recent high efficiency video coding (HEVC). In this paper, we introduce a new class of low-complexity 8-point DCT approximations based on a series of works published by Bouguezel, Ahmed and Swamy. Also, a multiparametric fast algorithm t…

2020-06-19cs.CVcs.MMeess.IV

无需采样的扩散变换器用于低复杂度MIMO信道估计

Sampling-Free Diffusion Transformers for Low-Complexity MIMO Channel Estimation

本文提出无需采样的扩散变换器(SF-DiT-CE)用于低复杂度MIMO信道估计，利用MIMO信道的角域稀疏性，通过轻量级DiT直接预测干净信道，避免迭代采样，提升准确性和鲁棒性。

2026-04-24eess.SP

使用低复杂度数论变换实现长多项式模乘

Long Polynomial Modular Multiplication using Low-Complexity Number Theoretic Transform

本文以教程形式建立环上多项式模乘与 DFT 的联系，面向同态加密应用，系统介绍并对比了基于数论变换的零填充卷积、负包裹卷积和低复杂度负包裹卷积三种长多项式模乘实现方法。

2023-12-22cs.CReess.SP

A Class of Low-complexity DCT-like Transforms for Image and Video Coding

The discrete cosine transform (DCT) is a relevant tool in signal processing applications, mainly known for its good decorrelation properties. Current image and video coding standards -- such as JPEG and HEVC -- adopt the DCT as a fundamental building block for compression. Recent works have introduced low-complexity approximations for the DCT, which become paramount in applications demanding real-time computation and low-power consumption. The design of DCT approximations involves a trade-off between computational complexity and performance. This paper introduces a new multiparametric transfor…

2022-12-08cs.MMcs.NAeess.IV

利用跳样大小降低连续小波变换在声学识别中的计算复杂度

Reduce Computational Complexity for Continuous Wavelet Transform in Acoustic Recognition Using Hop Size

本文提出通过设定跳样大小来减少连续小波变换在声学识别中的计算复杂度，从而降低计算成本并保持模型性能。

2025-11-28eess.ASeess.SP

面向图像与视频编码的基于角度相似性的低复杂度8点DCT近似

Low-complexity 8-point DCT Approximation Based on Angle Similarity for Image and Video Coding

本研究针对PCA在高约束场景下的应用局限，提出基于角度相似性最小化的低复杂度8点DCT近似方法，所得正交变换矩阵复杂度低、编码性能优，在特定压缩比下图像编码效果优于精确DCT，并完成了FPGA原型实现。

2024-01-30cs.MMeess.IVeess.SP

基于最小角度相似性的更大块长度低复杂度DCT近似扩展

Extensions on Low-complexity DCT Approximations for Larger Blocklengths Based on Minimal Angle Similarity

Programa de Pós-Graduação em Estatística, Universidade Federal de Pernambuco（统计硕士课程，巴伊亚联邦大学）；Universidade Federal de Santa Maria（圣玛丽亚联邦大学）；Universidade Federal de Pernambuco (UFPE)（巴伊亚联邦大学（UFPE））；Departamento de Estatística and LACESM, Universidade Federal de Santa Maria（统计系和LACESM，圣玛丽亚联邦大学）；Industrial Signal Processing Laboratory, Departamento de Tecnologia, UFPE（工业信号处理实验室，技术系，UFPE）

本文提出基于最小角度相似性的低复杂度DCT近似方法，改进了更大块长度下的变换性能，实验显示其在图像编码中优于现有方法。

2026-01-27cs.CVcs.NAeess.IV

Low-complexity Three-dimensional Discrete Hartley Transform Approximations for Medical Image Compression

The discrete Hartley transform (DHT) is a useful tool for medical image coding. The three-dimensional DHT (3D DHT) can be employed to compress medical image data, such as magnetic resonance and X-ray angiography. However, the computation of the 3D DHT involves several multiplications by irrational quantities, which require floating-point arithmetic and inherent truncation errors. In recent years, a significant progress in wireless and implantable biomedical devices has been achieved. Such devices present critical power and hardware limitations. The multiplication operation demands higher hardw…

2022-05-31cs.MMcs.NAeess.IV

FaSST: 快速稀疏化二次变换

FaSST: Fast Sparsifying Secondary Transform

本文提出FaSST框架，通过分解数据驱动稀疏正交变换为Givens旋转序列，降低计算复杂度，实现与LFNST同等的率失真性能并减少83.67%的计算量。

2026-05-14eess.IVeess.SP

Low-complexity Rounded KLT Approximation for Image Compression

Universidade Federal de Pernambuco（伯南布哥联邦大学）；Universidade Federal de Santa Maria（圣玛丽亚联邦大学）；UFPE（伯南布哥联邦大学）

The Karhunen-Loève transform (KLT) is often used for data decorrelation and dimensionality reduction. Because its computation depends on the matrix of covariances of the input signal, the use of the KLT in real-time applications is severely constrained by the difficulty in developing fast algorithms to implement it. In this context, this paper proposes a new class of low-complexity transforms that are obtained through the application of the round function to the elements of the KLT matrix. The proposed transforms are evaluated considering figures of merit that measure the coding power and dist…

2021-11-28cs.CVcs.NAeess.IV

Fast Discrete Fourier Transform algorithms requiring less than 0(NlogN) multiplications

In the paper it is shown that there exist infinite classes of fast DFT algorithms having multiplicative complexity lower than O(NlogN), i.e. smaller than their arithmetical complexity. The derivation starts with nesting of Discrete Fourier Transform (DFT) of size N = q_1 q_2 ... q_r, where q_i are powers of prime numbers: DFT is mapped into multidimensional one, Rader convolutions of q_i-point DFTs extracted, and combined into multidimensional convolutions processing data in parallel. Crucial to further optimization is the observation that multiplicative complexity of such algorithm is upper b…

2023-03-05eess.SP