How to Generate Repeatable Keys Using Physical Unclonable Functions Correcting PUF Errors with Iteratively Broadening and Prioritized Search

Abstract

We present an algorithm for repeatably generating keys using entropy from a Physical Unclonable Function (PUF). PUFs are logically identical physical constructs with Challenge-Response Pairs (CRPs) unique to each device. Applications include initialization of server keys and encryption of FPGA configuration bitstreams. One problem with PUFs is response… (More)

Topics

6 Figures and Tables

Cite this paper

@article{Price2014HowTG, title={How to Generate Repeatable Keys Using Physical Unclonable Functions Correcting PUF Errors with Iteratively Broadening and Prioritized Search}, author={Nathan E. Price and Alan T. Sherman}, journal={IACR Cryptology ePrint Archive}, year={2014}, volume={2014}, pages={1023} }