Open AccessWeighted Hamming distance for PUF performance evaluation
Author(s) -
Sadr A.,
ZolfaghariNejad M.
Publication year - 2013
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2013.2326
Subject(s) - hamming distance , measure (data warehouse) , physical unclonable function , hamming code , overhead (engineering) , identification (biology) , hamming weight , similarity measure , authentication (law) , similarity (geometry) , computer science , set (abstract data type) , function (biology) , algorithm , mathematics , pattern recognition (psychology) , data mining , artificial intelligence , cryptography , decoding methods , block code , botany , computer security , evolutionary biology , biology , programming language , image (mathematics) , operating system
To analyse and compare physical unclonable function (PUF) concepts, a set of parameters should be defined to measure performance. The Hamming distance (HD) is a parameter to measure the number of different elements of two strings of the same length. In this reported research, weighted HD is proposed to evaluate and compare the performance of PUFs. The proposed parameter uses weights for calculating similarity measure. The weights can eliminate the effects of noisy responses. The proposed parameter is more efficient and has a low overhead and can be used in identification and authentication applications.