Cryptology ePrint Archive: Report 2020/387

Low-complexity and Reliable Transforms for Physical Unclonable Functions

Onur Gunlu and Rafael F. Schaefer

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.

Category / Keywords: foundations / physical unclonable function (PUF), no multiplication transforms, secret key agreement, low complexity.

Date: received 4 Apr 2020

Contact author: guenlue at tu-berlin de

Available format(s): PDF | BibTeX Citation

Note: To appear in IEEE International Conference on Acoustics, Speech, and Signal Processing 2020

Version: 20200409:124258 (All versions of this report)

Short URL: ia.cr/2020/387


[ Cryptology ePrint archive ]