Post-Quantum Cryptography: A Zero-Knowledge Authentication Protocol
This addresses the need for quantum-resistant authentication protocols in cryptography, though it appears incremental as it builds on existing zero-knowledge and post-quantum concepts.
The paper tackles the problem of secure authentication in a post-quantum setting by proposing a zero-knowledge protocol based on non-commutative algebra and the generalized symmetric decomposition problem, with security relying on the computational hardness of this problem against quantum attacks.
In this paper, we present a simple bare-bones solution of a Zero-Knowledge authentication protocol which uses non-commutative algebra and a variation of the generalized symmetric decomposition problem (GSDP) as a one-way function. The cryptographic security is assured as long the GSDP problem is computationally hard to solve in non-commutative algebraic structures and belongs currently to the PQC category as no quantum computer attack is likely to exists.