Silicon physical random functions

B. Gassend, D. Clarke, M. Van Dijk, S. Devadas

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

We introduce the notion of a Physical Random Function (PUF). We argue that a complex integrated circuit can be viewed as a silicon PUF and describe a technique to identify and authenticate individual integrated circuits (ICs). We describe several possible circuit realizations of different PUFs. These circuits have been implemented in commodity Field Programmable Gate Arrays (FPGAs). We present experiments which indicate that reliable authentication of individual FPGAs can be performed even in the presence of significant environmental variations. We describe how secure smart cards can be built, and also briefly describe how PUFs can be applied to licensing and certification applications.
Original languageEnglish
Title of host publicationProceedings of the ACM Conference on Computer and Communications Security
PublisherAssociation for Computing Machinery (ACM)
Pages148-160
DOIs
Publication statusPublished - 2002
Externally publishedYes
EventProceedings of the 9th ACM Conference on Computer and Communications Security - , United States
Duration: 18 Nov 200222 Nov 2002

Publication series

NameProceedings of the ACM Conference on Computer and Communications Security
ISSN (Print)1543-7221

Conference

ConferenceProceedings of the 9th ACM Conference on Computer and Communications Security
Country/TerritoryUnited States
Period18/11/0222/11/02

Fingerprint

Dive into the research topics of 'Silicon physical random functions'. Together they form a unique fingerprint.

Cite this