Show simple item record

dc.contributor.advisorDevadas, Srinivasen_US
dc.contributor.authorGassend, Blaiseen_US
dc.date.accessioned2023-03-29T15:36:46Z
dc.date.available2023-03-29T15:36:46Z
dc.date.issued2003-02
dc.identifier.urihttps://hdl.handle.net/1721.1/149975
dc.description.abstractIn 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.en_US
dc.relation.ispartofseriesMIT-LCS-TR-881
dc.titlePhysical Random Functionsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record