Year: 2025
Type: article
Abstract: Quantum computing presents a significant threat to traditional cryptographic protocols, particularly those relying on the hardness of factoring large integers and computing discrete logarithms, as quantum algorithms can solve these problems in polynomial time. With the advent of quantum computers capable of breaking current cryptographic schemes, the need for quantum-resistant cryptographic mechanisms has become increasingly urgent. In this paper, we focused on authentication, a critical security property, and reviewed various classical cryptographic techniques to this aim and their potential to resist quantum attacks. We present a (non-exhaustive) overview of the state of the art in quantum-resistant authentication, particularly through symmetric cryptography, digital signatures, and hardware-based approaches such as physical unclonable functions ($\textsf{PUF}$s). By offering a clear and focused analysis, we used this survey to bridge the gap between diverse academic communities and provide a foundation for future research in post-quantum authentication.
Source: AIMS Mathematics
DOI: 10.3934/math.2025779
Authors: Ana I. González-Tablas, Universidad Carlos Ⅲ de Madrid, Dpto. de Informática, COSEC Lab. Avda. de la Universidad, 30. 28911 Leganés, Madrid, España, María Isabel González Vasco, Universidad Carlos Ⅲ de Madrid, Dpto. de Matemáticas, Avda. de la Universidad, 30. 28911 Leganés, Madrid, España
Institution: Universidad Carlos III de Madrid
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $1,200
Awards: G464105488, G4787786319, G8868695926
OpenAlex ID: W4412865751