Efficient key generation scheme for SRAM-PUFs using polar codes

Bin Chen, Tanya Ignatenko, Frans Willems

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

54 Downloads (Pure)


Physical unclonable functions (PUFs) are a new promising means to realize cryptographic scenarios such as identification, authentication and secret key generation. PUFs avoid the need for key storage, because the device-unique randomness can be translated into a cryptographic key. SRAM-PUFs enjoy the properties that, while being easily evaluated (after a device power-up), they are unique, reproducible, physically unclonable and unpredictable. Error correction codes (ECCs) are essential blocks of secret-generation schemes, since PUF observations are always effected by noise and environmental changes. In this paper, we propose practical error correction schemes for PUF-based secret generation that are based on polar codes. The proposed scheme could generate a 128-bit key or 256-bit key using less PUF bits and helper data bits than before and achieve a low failure probability for a practical SRAM-PUFs application with error probability between 15% and 25%. Therefore SRAM-PUFs are considered to combine very well with authentication and unique cryptographic key generation for resource constrained devices.
Original languageEnglish
Title of host publicationPROCEEDINGS of the 2017 Symposium on Information Theory and Signal Processing in the Benelux
EditorsRichard Heusden, Jos H. Weber
PublisherInstitute of Electrical and Electronics Engineers
Number of pages8
ISBN (Electronic)9778-94-6186-811-4
Publication statusPublished - 2017
EventSymposium on Information Theory and Signal Processing in the Benelux - Delft, Netherlands
Duration: 11 May 201712 May 2017


ConferenceSymposium on Information Theory and Signal Processing in the Benelux
Abbreviated titleSITB2017


Dive into the research topics of 'Efficient key generation scheme for SRAM-PUFs using polar codes'. Together they form a unique fingerprint.

Cite this