  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.
