[Resource Topic] 2020/387: Low-complexity and Reliable Transforms for Physical Unclonable Functions

Welcome to the resource topic for 2020/387

Low-complexity and Reliable Transforms for Physical Unclonable Functions

Authors: Onur Gunlu, Rafael F. Schaefer


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.

ePrint: https://eprint.iacr.org/2020/387

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .