Post-Quantum Cryptography: A Zero-Knowledge Authentication Protocol

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.

arXiv comment3 pages

References in corpus (2)

• Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
• Post-Quantum Cryptography(PQC): Generalized ElGamal Cipher over GL(8,F251)

Cited by in corpus (1)

• Algebraic Extension Ring Framework for Non-Commutative Asymmetric Cryptography