An Authentication Scheme Based On Minrank Problem

Identity authentication is an important research area in cryptography and an impor-tant guarantee for network information security.Most of the current identity authentica-tion schemes are based on Number theory problems such as large number decomposition problems and discrete logarithm problems.However,as the security requirements grad-ually increase,the key length is gradually increasing:and once the algorithm of the large number factorization algorithm and the discrete logarithm problem are broken,these identity authentication schemes will no longer be secure.Zero-knowledge identity authentication schemes based on non-number theory problems can make up for these shortcomings,and such schemes often have lower communication complexity.Stern proposed a zero-knowledge identity authentication scheme based on the error-correcting code problem in 1993,and then more and more zero-knowledge identity authentication schemes based on non-number theory difficulties were proposed.These schemes have a high probability of a successful counterfeiter,usually around 2/3.so multi-ple rounds of queries are required to meet the established security requirements.Courtois proposes a zero-knowledge identity based on the minrank problem in 2001,In this sce-nario,the probability of a successful attack by the attacker is O.In order to make the attacker7s probability of spoofing success less than 2-20,approximately 35 round inquiry is required.In this thesis we improve the Courtois method,based on the same difficult problem.In our identity authentication.The probability of a successful spoof is close to1/2,so that the probability of an attacker's success is less than 2-20,and now only about 20 rounds of inquiry are required.At the same time,the information transmission amount of our scheme is not much increased compared with the original scheme.