Zero-Knowledge Protocol and Digital Signature Algorithm

This paper discusses the construction of a post-quantum zero-knowledge authentication protocol and its trans-formation into a digital signature algorithm whose security is based on the computational difficulty of solving large systems of power equations. Finite non-commutative associative algebras (FNAA), specifically finite algebras of square matrices of varying sizes, are proposed as the algebraic support. It is shown that, compared to known analogues, the proposed digital signature algorithm has a significantly smaller total size of the signature and public key. In various versions of the developed algorithm, FNAA of various dimensions are used as an algebraic carrier.

Authors: B. Ya. Sovetov, V. V. Tsekhanovsky, N. A. Moldovyan, A. A. Kostina

Direction: Informatics, Computer Technologies And Control

Keywords: post-quantum cryptography, zero-knowledge protocol, digital signature algorithm, finite non-commutative algebra, finite matrix algebra, system of power equations

---

View full article