Choice of Optimal Error-Correcting Code for Physical Unclonable Functions

dc.contributor.authorJarvis, Brian
dc.date2015-12-09
dc.date.accessioned2016-05-19T20:11:32Z
dc.date.available2016-05-19T20:11:32Z
dc.date.issued2015-12-09
dc.description.abstractThis thesis explores error-correcting codes which can be used in physical unclonable function (PUF) applications. We investigate linear block codes and concatenated codes, which are traditionally used with PUFs, and compare them to convolutional codes using the criteria of error correction capability, decoder hardware requirements, flexibility of code parameters, and code rate. The application of the selected code to various fuzzy extractor schemes is analyzed. Further, the selected convolutional codes are implemented in hardware using a Xilinx Artix 7 FPGA and its resource utilization estimated. Extensive experiments based on software implementations in C++ and Python are performed in order to determine the code resistance to various error patterns seen at the outputs of practical implementations of PUFs, such as Ring-Oscillator PUF and SR latch PUF. We conclude that convolutional codes, implemented independently or in a concatenated construction, are capable of matching the error correction performance of the often used BCH code for the majority of realistic error patterns. At the same time, many of the selected convolutional codes occupy far fewer hardware resources when implemented in an FPGA.
dc.identifier.urihttps://hdl.handle.net/1920/10255
dc.language.isoen
dc.subjectError correcting codes
dc.subjectPhysical unclonable functions
dc.subjectFuzzy extractors
dc.subjectConvolutional codes
dc.titleChoice of Optimal Error-Correcting Code for Physical Unclonable Functions

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Jarvis_thesis_2015.pdf
Size:
1.37 MB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: