Silicon physical random functions
Top Cited Papers
- 18 November 2002
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 148-160
- https://doi.org/10.1145/586110.586132
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.Keywords
This publication has 4 references indexed in Scilit:
- VariationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- IC identification circuit using device mismatchPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Low cost attacks on tamper resistant devicesLecture Notes in Computer Science, 1998
- Calculating worst-case gate delays due to dominant capacitance couplingPublished by Association for Computing Machinery (ACM) ,1997