Paper 2020/387 Original: eprint.iacr.org/2020/387 ↗
Low-complexity and Reliable Transforms for Physical Unclonable Functions
Abstract
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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2020-04-09: last updated
- 2020-04-09: published
- Short URL
- https://ia.cr/2020/387
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2020/387,
author = {Onur Gunlu and Rafael F. Schaefer},
title = {Low-complexity and Reliable Transforms for Physical Unclonable Functions},
howpublished = {Cryptology {ePrint} Archive, Paper 2020/387},
year = {2020},
url = {https://eprint.iacr.org/2020/387}
}