Comparative analysis of SRAM memories used as PUF primitives
Authors:
- 1 March 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15301591,p. 1319-1324
Abstract
In this publication we present the results of our investigations into the reliability and uniqueness of Static Random Access Memories (SRAMs) in different technology nodes when used as a Physically Unclonable Function (PUF). The comparative analysis that can be found in this publication is the first ever of its kind, using different SRAM memories in technologies ranging from 180nm to 65nm. Each SRAM memory presents a unique and unpredictable start-up pattern when being powered up. In order to use an SRAM as a PUF in an application, the stability of its start-up patterns needs to be assured under a wide variety of conditions such as temperature and applied voltage. Furthermore the start-up patterns of different memories must be unique and contain sufficient entropy. This paper presents the results of tests that investigate these properties of different SRAM memory technology nodes. Furthermore, it proposes the construction of a fuzzy extractor, which can be used in combination with the tested memories for extracting secure cryptographic keys.Keywords
This publication has 9 references indexed in Scilit:
- Hardware intrinsic security from D flip-flops2010
- Power-Up SRAM State as an Identifying Fingerprint and Source of True Random NumbersIEEE Transactions on Computers, 2008
- Extended abstract: The butterfly PUF protecting IP on every FPGA2008
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy DataSIAM Journal on Computing, 2008
- Security with Noisy Data2007
- 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
- Silicon physical random functions2002
- The context-tree weighting method: basic propertiesIEEE Transactions on Information Theory, 1995