  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.
