Post-Quantum Cryptography: A Zero-Knowledge Authentication Protocol

TL;DR

This paper introduces a zero-knowledge authentication protocol based on non-commutative algebra and the generalized symmetric decomposition problem, offering quantum-resistant security for cryptographic authentication.

Contribution

It proposes a novel zero-knowledge authentication scheme utilizing non-commutative algebra and GSDP, enhancing post-quantum cryptographic methods.

Findings

Security relies on the hardness of GSDP in non-commutative structures.

Protocol is simple and potentially practical for quantum-resistant authentication.

No known quantum attacks can currently compromise the scheme.

Abstract

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.