一种改进的基于码的身份识别方案
Improved code-based identification scheme
摘要：
我们重新审视了Stern在Crypto'93上提出的基于3遍码的身份识别方案，并给出了一个新的5遍协议，其中欺骗者的概率为1/2（而不是Stern原始提案中的2/3）。此外，我们建议使用准循环结构，以显着减少的公钥的大小。所提出的方案是零知识，并依赖于一个NP完全问题来自编码理论（即q元伴随式解码问题）。考虑到最近对任意有限域Fq上的线性码的Stern信息集译码算法的推广的研究，我们建议参数使得公钥为34 Kbits，而Stern方案的公钥约为66 Kbits。这提供了一个非常实用的身份识别（和可能的签名）方案，它对于轻量级密码学来说是最有吸引力的
英文摘要：
We revisit the 3-pass code-based identification scheme proposed by Stern at Crypto'93, and give a new 5-pass protocol for which the probability of the cheater is 1/2 (instead of 2/3 in the original Stern's proposal). Furthermore, we propose to use quasi-cyclic construction in order to dramatically reduce the size of the public key. The proposed scheme is zero-knowledge and relies on an NP-complete problem coming from coding theory (namely the q-ary Syndrome Decoding problem). Taking into account a recent study of a generalization of Stern's information-set-decoding algorithm for decoding linear codes over arbitrary finite fields Fq we suggest parameters so that the public key be 34Kbits while those of Stern's scheme is about 66Kbits. This provides a very practical identification (and possibly signature) scheme which is mostly attractive for light-weight cryptography
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
