Single-Round Pattern Matching Key Generation Using Physically Unclonable Function

Abstract EN

Paral and Devadas introduced a simple key generation scheme with a physically unclonable function (PUF) that requires no error correction, e.g., by using a fuzzy extractor.

Their scheme, called a pattern matching key generation (PMKG) scheme, is based on pattern matching between auxiliary data, assigned at the enrollment in advance, and a substring of PUF output, to reconstruct a key.

The PMKG scheme repeats a round operation, including the pattern matching, to derive a key with high entropy.

Later, to enhance the efficiency and security, a circular PMKG (C-PMKG) scheme was proposed.

However, multiple round operations in these schemes make them impractical.

In this paper, we propose a single-round circular PMKG (SC-PMKG) scheme.

Unlike the previous schemes, our scheme invokes the PUF only once.

Hence, there is no fear of information leakage by invoking the PUF with the (partially) same input multiple times in different rounds, and, therefore, the security consideration can be simplified.

Moreover, we introduce another hash function to generate a check string which ensures the correctness of the key reconstruction.

The string enables us not only to defeat manipulation attacks but also to prove the security theoretically.

In addition to its simple construction, the SC-PMKG scheme can use a weak PUF like the SRAM-PUF as a building block if our system is properly implemented so that the PUF is directly inaccessible from the outside, and, therefore, it is suitable for tiny devices in the IoT systems.

We discuss its security and show its feasibility by simulations and experiments.