Online Reliability Testing for PUF Key Derivation

Physical Unclonable Functions (PUFs) measure manufacturing variations inside integrated circuits to derive internal secrets during run-time and avoid to store secrets permanently in non-volatile memory. PUF responses are noisy such that they require error correction to generate reliable cryptographic keys. To date, when needed one single key is reproduced in the field and always used, regardless of its reliability. In this work, we compute online reliability information for a reproduced key and perform multiple PUF readout and error correction steps in case of an unreliable result. This permits to choose the most reliable key among multiple derived key candidates with different corrected error patterns. We achieve the same average key error probability from less PUF response bits with this approach. Our proof of concept design for a popular reference scenario uses Differential Sequence Coding (DSC) and a Viterbi decoder with reliability output information. It requires 39% less PUF response bits and 16% less helper data bits than the regular approach without the option for multiple readouts.

[1]  Bart Preneel,et al.  Soft Decision Error Correction for Compact Memory-Based PUFs Using a Single Enrollment , 2012, CHES.

[2]  Martin Bossert,et al.  Channel Coding for Telecommunications , 1999 .

[3]  Matthias Hiller,et al.  Complementary IBS: Application specific error correction for PUFs , 2012, 2012 IEEE International Symposium on Hardware-Oriented Security and Trust.

[4]  Jorge Guajardo,et al.  FPGA Intrinsic PUFs and Their Use for IP Protection , 2007, CHES.

[5]  Matthias Hiller,et al.  Seesaw: An Area-Optimized FPGA Viterbi Decoder for PUFs , 2014, 2014 17th Euromicro Conference on Digital System Design.

[6]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[7]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[8]  Peter A. Hoeher,et al.  Word Error Probability Estimation by Means of a Modified Viterbi Decoder , 2007, 2007 IEEE 66th Vehicular Technology Conference.

[9]  Matthias Hiller,et al.  Cherry-Picking Reliable PUF Bits With Differential Sequence Coding , 2016, IEEE Transactions on Information Forensics and Security.

[10]  Robert M. Gray,et al.  Coding for noisy channels , 2011 .

[11]  Carl W. Baum,et al.  A Reliability Output Viterbi Algorithm with Applications to Hybrid ARQ , 1998, IEEE Trans. Inf. Theory.

[12]  Srinivas Devadas,et al.  Secure and robust error correction for physical unclonable functions , 2010, IEEE Design & Test of Computers.

[13]  Srinivas Devadas,et al.  Physical Unclonable Functions and Applications: A Tutorial , 2014, Proceedings of the IEEE.

[14]  Rafail Ostrovsky,et al.  Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data , 2004, SIAM J. Comput..

[15]  G. Edward Suh,et al.  Physical Unclonable Functions for Device Authentication and Secret Key Generation , 2007, 2007 44th ACM/IEEE Design Automation Conference.

[16]  Ingrid Verbauwhede,et al.  Low-Overhead Implementation of a Soft Decision Helper Data Algorithm for SRAM PUFs , 2009, CHES.

[17]  Srinivas Devadas,et al.  Maximum-likelihood decoding of device-specific multi-bit symbols for reliable key generation , 2015, 2015 IEEE International Symposium on Hardware Oriented Security and Trust (HOST).

[18]  Martin Bossert,et al.  Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes , 1995, IEEE Trans. Inf. Theory.

[19]  Ahmad-Reza Sadeghi,et al.  Efficient Helper Data Key Extractor on FPGAs , 2008, CHES.

[20]  Srinivas Devadas,et al.  Delay-based circuit authentication and applications , 2003, SAC '03.

[21]  Michael Weiner,et al.  Breaking through fixed PUF block limitations with differential sequence coding and convolutional codes , 2013, TrustED '13.