On the high-speed program implementation of zero-knowledge authentication protocols

The paper provides a comparative analysis of the capacity of the Schnorr authentication protocol and the authentication protocol based on the problem of finding a Hamiltonian cycle in a graph. It is shown that with the use of CUDA technology the capacity of protocols on graphs is not inferior to the capacity of the Schnorr protocol.