Fraunhofer-Gesellschaft

Publica

Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs

 
: Immler, V.; Hiller, M.; Liu, Q.; Lenz, A.; Wachter-Zeh, A.

:

Ali, S.S.:
Security, Privacy, and Applied Cryptography Engineering : 7th International Conference, SPACE 2017, Goa, India, December 13-17, 2017. Proceedings
Cham: Springer International Publishing, 2017 (Lecture Notes in Computer Science 10662)
ISBN: 978-3-319-71501-8
ISBN: 978-3-319-71500-1
S.190-209
International Conference on Security, Privacy, and Applied Cryptography Engineering (SPACE) <7, 2017, India>
Englisch
Konferenzbeitrag
Fraunhofer AISEC ()

Abstract
Device-specific physical characteristics provide the foundation for Physical Unclonable Functions (PUFs), a hardware primitive for secure storage of cryptographic keys. So far, they have been implemented by either directly evaluating a binary output or by mapping outputs from a higher-order alphabet to a fixed-length bit sequence. However, the latter causes a significant bias in the derived key when combined with an equidistant quantization. To overcome this limitation, we propose a variable-length bit mapping that reflects the properties of a Gray code in a different metric, namely the Levenshtein metric instead of the classical Hamming metric. Subsequent error-correction is therefore based on a custom insertion/deletion correcting code. This new approach effectively counteracts the bias in the derived key already at the input side. We present the concept for our scheme and demonstrate its feasibility based on an empirical PUF distribution. As a result, we increase the effective output bit length of the secret by over 40% compared to state-of-the-art approaches while at the same time obtaining additional advantages, e.g., an improved tamper-sensitivity. This opens up a new direction of Error-Correcting Codes (ECCs) for PUFs that output responses with symbols of higher-order output alphabets.

: http://publica.fraunhofer.de/dokumente/N-502419.html