Hardware intrinsic security from D flip-flops
Authors:
Open Access
- 4 October 2010
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 53-62
Abstract
In this paper we describe the results of our investigations Supported by EU FP7 project UNIQUE on the randomness and reliability of D flip-flops when used as a Physically Unclonable Function (PUF). These D flip-flops are hardware components which present a random start-up value when powered up. We show that against all odds, enough randomness exists in such elements when implemented on an Application-Specific Integrated Circuit (ASIC) to turn the responses of a number of D flip-flops into a secret random sequence allowing to derive keys for use in conjunction with cryptographic algorithms. In addition to being unpredictable, these flip-flops have the advantage that they can be spread over random locations in an ASIC. This makes them very difficult to reverse-engineer when used to hide a secret key in a design at a relatively small cost in resources.Keywords
This publication has 14 references indexed in Scilit:
- Estimating the Entropy of Binary Time Series: Methodology, Some Theory and a Simulation StudyEntropy, 2008
- Efficient Helper Data Key Extractor on FPGAs2008
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy DataSIAM Journal on Computing, 2008
- Physical Unclonable Functions and Public-Key Crypto for FPGA IP Protection2007
- FPGA Intrinsic PUFs and Their Use for IP Protection2007
- Estimating the Secrecy-Rate of Physical Unclonable Functions with the Context-Tree Weighting Method2006
- A technique to build a secret key in integrated circuits for identification and authentication applications2004
- The context-tree weighting method: extensionsIEEE Transactions on Information Theory, 1998
- Context weighting for general finite-context sourcesIEEE Transactions on Information Theory, 1996
- The context-tree weighting method: basic propertiesIEEE Transactions on Information Theory, 1995