On the (re)design of an FPGA-based PUF

Philipp Grabher; Dan Page; Marcin Wójcik

Paper 2013/195

On the (re)design of an FPGA-based PUF

Philipp Grabher, Dan Page, and Marcin Wójcik

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: Published elsewhere. Unknown where it was published
Keywords: FPGA PUF
Contact author(s): wojcik @ cs bris ac uk
History: 2013-04-09: received
Short URL: https://ia.cr/2013/195
License: CC BY

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},
      note = {\url{https://eprint.iacr.org/2013/195}},
      url = {https://eprint.iacr.org/2013/195}
}