Efficiency analysis of cryptographic algorithms for applications in zk-SNARK

The paper presents a comparative efficiency analysis of various cryptographic algorithms in terms of applications in zk-SNARK based systems. To conduct experiments with measuring parameters, an infrastructure based on ZoKrates has been developed. A series of measurements with different input data was carried out for each algorithm. The number of constraints in the R1CS representation of the algorithm, the length of the proof key and the verification key, the running time of the setup phase of the protocol, and the proof generation time have been measured. As a result, we have obtained experimental data that allow us to determine the boundaries of the practical applicability of algorithms in distributed ledgers.