Review and Analysis of the Classical and Post-Quantum Ring Signature Algorithms

In this paper a review and analysis of ring signature algorithms based on discrete logarithm and code-based problems is made. The authors consider Linkable and Multilayer Linkable Spontaneous Anonymous Group Signatures which are based on the discrete logarithm problem. Taking into the account the fact that quantum computers have already been developed, we look at different variations of code-based signatures (linkable, multilayer linkable, traceable and threshold) and analyse the efficiency of their use. Finally, the analysis of these signatures is made and standard code-based algorithms are compared.