Figure 3

Schematic of CRP generation algorithm. When a request for CRP generation arrives, a challenge (C) is generated that comprises two particular cells from a specific PUF device and a response length (R). Comparing the currents of the first and second selected cells produces a bit represented by 0 or 1. Concatenating each bit into the response bits, the CRP is completed as a response of \(n\) bits.