中文摘要：

Schnorr身份认证方案是密码学中的经典方案，可以推广到很多其他数学问题（如离散对数问题）上，从而构造出在标准模式中安全的身份认证方案，并且可以通过Fiat—Shamir转换工具，将其转换为在随机谕示模式中安全的数字签名方案。但将上述转换方法用于基于格的密码学中时会出现一些特殊现象（如方案中止现象）。为此，通过矩阵表示方法分析Schnorr方案的构造方法，得出其构造方法成立的充要条件，从而使其可在更大范围内构造出安全的类Schnorr方案。根据类Schnorr方案，分析基于格的身份认证方案中的方案中止现象，并通过数学方法证明，对于某些身份认证方案（如∑-身份认证方案），其中的方案中止现象不可避免，该结论为深入研究基于格的密码学提供了参考依据。

英文摘要：

As one of classic identification schemes in cryptography, Schnorr＇s scheme can be applied with respect to many underlying mathematical hard problems, as well as discrete logarithm problem. Moreover, it can apply the Fiat-Shamir transform to convert a secure Schnorr＇s identification scheme in standard model into a secure digital signature scheme in the random oracle model. Aiming at the condition, this paper analyzes the features of Schnorr＇s scheme, the necessary and sufficient conditions for a secure Schnorr＇s scheme are derived, and hence it can construct the secure Schnorr-like scheme in a broader sense. Then, by using the concept of Schnorr-like scheme, it can prove rigorously that the existence of aborts in some lattice-based identification scheme, such as ∑-identity authentication scheme is inevitable, which sheds light on a better understanding of the lattice-based signature in the future.