Physical Random Functions
Name
MIT-LCS-TR-881.pdf
Size
793.83 KB
Format
Adobe PDF
Checksum (MD5)
2f3b15633ad7c10538ecac9f09b471da
Author(s)
Gassend, Blaise
Advisor(s)
Devadas, Srinivas
Date Issued
February 2003
Series/Report no.
MIT-LCS-TR-881
Abstract
In general, secure protocols assume that participants are able to maintain secret key information. In practice, this assumption is often incorrect as an increasing number of devices are vulnerable to physical attacks. Typical examples of vulnerable devices are smartcards and Automated Teller Machines. To address this issue, Physical Random Functions are introduced. These are Random Functions that are physically tied to a particular device. To show that Physical Random Functions solve the initial problem, it must be shown that they can be made, and that it is possible to use them to provide secret keys for higher level protocols. Experiments with Field Programmable Gate Arrays are used to evaluate the feasibility of Physical Random Functions in silicon.
Persistent DSpace Link
