Chaos-Based Physical Unclonable Functions
Krzysztof Gołofit , Piotr Z. Wieczorek
AbstractThe concept presented in this paper fits into the current trend of highly secured hardware authentication designs utilizing Physically Unclonable Functions (PUFs) or Physical Obfuscated Keys (POKs). We propose an idea that the PUF cryptographic keys can be derived from a chaotic circuit. We point out that the chaos theory should be explored for the sake of PUFs as a natural mechanism of amplifying random process variations of digital circuits. We prove the idea based on a novel design of a chaotic circuit, which utilizes time in a feedback loop as an analog continuous variable in a purely digital system. Our design is small and simple, and therefore feasible to implement in inexpensive reprogrammable devices (not equipped with digital clock manager, programmable delay line, phase locked loop, RAM/ROM memory, etc.). Preliminary tests proved that the chaotic circuit PUFs work in both advanced Field-Programmable Gate Arrays (FPGAs) as well as simple Complex Programmable Logic Devices (CPLDs). We showed that different PUF challenges (slightly different implementations based on variations in elements placement and/or routing) have provided significantly different keys generated within one CPLD/FPGA device. On the other hand, the same PUF challenges used in a different CPLD/FPGA instance (programmed with precisely the same bit-stream resulting in exactly the same placement and routing) have enhanced differences between devices resulting in different cryptographic keys.
|Journal series||Applied Sciences-Basel, ISSN 2076-3417, (A 25 pkt)|
|Publication size in sheets||49.55|
|Keywords in English||physically unclonable function; chaos theory; chaotic circuit; FPGA; CPLD; challenge-response authentication; hardware security; side-channel attacks; cryptographic keys|
|ASJC Classification||; ; ; ; ;|
|Score|| = 25.0, 29-04-2019, ArticleFromJournal|
= 0.0, 31-03-2019, ArticleFromJournal
|Publication indicators||= 0; = 0; : 2017 = 0.801; : 2017 = 1.689 (2) - 2017=1.855 (5)|
|Citation count*||1 (2019-08-21)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.