Comparison of Quantum PUF models
arXiv:2208.10599 · doi:10.1109/GCWkshps56602.2022.10008722
Abstract
Physical unclonable functions (PUFs) are hardware structures in a physical system (e.g. semiconductor, crystals etc.) that are used to enable unique identification of the semiconductor or to secure keys for cryptographic processes. A PUF thus generates a noisy secret reproducible at runtime. This secret can either be used to authenticate the chip, or it is available as a cryptographic key after removing the noise. Latest advancements in the field of quantum hardware, in some cases claiming to achieve quantum supremacy, highly target the fragility of current RSA type classical cryptosystems. As a solution, one would like to develop Quantum PUFs to mitigate such problem. There are several approaches for this technology. In our work we compare these different approaches and introduce the requirements for QTOKSim, a quantum token based authentication simulator testing its performance on a multi-factor authentication protocol.
References in corpus (8)
- Single ion-qubit exceeding one hour coherence time
- NetSquid, a NETwork Simulator for QUantum Information using Discrete events
- SeQUeNCe: A Customizable Discrete-Event Simulator of Quantum Networks
- Intel Quantum Simulator: A cloud-ready high-performance simulator of quantum circuits
- QuNetSim: A Software Framework for Quantum Networks
- Quantum Physical Unclonable Functions: Possibilities and Impossibilities
- Compact 3D quantum memory
- Quantum multi-factor authentication