Welcome to the resource topic for 2009/255
Title:
SIMPL Systems: On a Public Key Variant of Physical Unclonable Functions
Authors: Ulrich Rührmair
Abstract:This paper theoretically discusses a novel security tool termed {\it SIMPL system}, which can be regarded as a public key version of physical unclonable functions (PUFs). Like the latter, a SIMPL system S is physically unique and non-reproducible, and implements an individual function F_S. In opposition to a PUF, however, a SIMPL system S possesses a publicly known numerical description D(S), which allows its digital simulation and prediction. At the same time, it is required that any digital simulation of a SIMPL system S must work at a detectably lower speed than its real-time behavior. In other words, the holder of a SIMPL system S can evaluate a publicly known, publicly computable function F_S faster than anyone else. This feature, so we argue in this paper, allows a number of improved practicality and security features. Once implemented successfully, SIMPL systems would have specific advantages over PUFs, certificates of authenticity, physically obfuscated keys, and also over standard mathematical cryptotechniques.
ePrint: https://eprint.iacr.org/2009/255
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .