Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs

DOI10.1007/978-3-319-71501-8_11zbMath1505.68002OpenAlexW2770512012MaRDI QIDQ5055970

Vincent Immler, Matthias Hiller, Qinzhi Liu, Antonia Wachter-Zeh, Andreas Lenz

Publication date: 9 December 2022

Published in: Security, Privacy, and Applied Cryptography Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-71501-8_11

zbMATH Keywords

quantizationcoding theoryphysical unclonable functionsfuzzy extractorsecrecy leakageVarshamov-Tenengolts (VT) code

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computer security (68M25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Secure key generation from biased PUFs
• Efficient fuzzy extraction of PUF-induced secrets: theory and applications
• Physically Unclonable Functions
• Nonbinary codes, correcting single deletion or insertion (Corresp.)
• Advances in Cryptology - EUROCRYPT 2004
• Attacking PUF-Based Pattern Matching Key Generators via Helper Data Manipulation

This page was built for publication: Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs