Paper 2013/195 Original: eprint.iacr.org/2013/195 ↗
On the (re)design of an FPGA-based PUF
Abstract
Physically Unclonable Functions (PUFs) represent a promising basis for solutions to problems such as secure key storage, and delivery of higher-level applications such as authentication. Although effective PUF designs exist for CMOS-based technologies (e.g., arbiter PUFs), their implementation on FPGAs remains a challenge (e.g., because of their routing characteristics). With this in mind, Anderson described a PUF design specifically tailored towards FPGAs. In this paper we identify and analyse a flaw in said design which renders it impractical for security-critical use. We describe two alternative solutions (relating to different tradeoffs) that eliminate this flaw.
Metadata
- Available format(s)
PDF- Category
- Applications
- Publication info
- Preprint.
- History
- 2013-04-09: last updated
- 2013-04-09: published
- Short URL
- https://ia.cr/2013/195
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2013/195,
author = {Philipp Grabher and Dan Page and Marcin Wójcik},
title = {On the (re)design of an FPGA-based PUF},
howpublished = {Cryptology {ePrint} Archive, Paper 2013/195},
year = {2013},
url = {https://eprint.iacr.org/2013/195}
}