Paper 2022/1005 Original: eprint.iacr.org/2022/1005 ↗
PUF-COTE: A PUF Construction with Challenge Obfuscation and Throughput Enhancement
Abstract
Physically Unclonable Functions~(PUFs) have been a potent choice for enabling low-cost, secure communication. However, the state-of-the-art strong PUFs generate single-bit response. So, we propose PUF-COTE: a high throughput architecture based on linear feedback shift register and a strong PUF as the ``base''-PUF. At the same time, we obfuscate the challenges to the ``base''-PUF of the final construction. We experimentally evaluate the quality of the construction by implementing it on Artix 7 FPGAs. We evaluate the statistical quality of the responses~(using NIST SP800-92 test suit and standard PUF metrics: uniformity, uniqueness, reliability, strict avalanche criterion, ML-based modelling), which is a crucial factor for cryptographic applications.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2022-08-10: last updated
- 2022-08-04: published
- Short URL
- https://ia.cr/2022/1005
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2022/1005,
author = {Boyapally Harishma and Durba Chatterjee and Kuheli Pratihar and Sayandeep Saha and Debdeep Mukhopadhyay},
title = {PUF-COTE: A PUF Construction with Challenge Obfuscation and Throughput Enhancement},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/1005},
year = {2022},
url = {https://eprint.iacr.org/2022/1005}
}