{'fraction_non_alphanumeric': 0.02096177558569667, 'fraction_numerical': 0.0, 'mean_word_length': 5.823529411764706, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Unclonable identification and authentication based on reference list decoding

In this paper we advocate a new approach to item identification based on physical unclonable features. Being unique characteristics of an item, these features represent a kind of unstructured random code-book that links the identification problem to digital communications via composite hypothesis testing. Besides this, complexity, memory storage and universality constraints should be taken into account for databases with several hundred millions entries. Therefore, we attempt to find a trade-off between performance, security, memory storage and universal-ity constraints. A practical suboptimal method is considered based on our reference list decoding (RLD) framework. Similar setup is extended to the authentication problem.