Low-complexity and Reliable Transforms for Physical Unclonable Functions
This work addresses security and reliability constraints for PUF-based key storage, offering incremental improvements in error performance for specific hardware applications.
The authors tackled the problem of generating reliable secret keys from noisy physical unclonable functions (PUFs) by proposing low-complexity orthogonal transforms without multiplication, achieving significantly better bit-error probability than prior methods and a block-error probability much smaller than previous codes with similar rates.
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.