Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2022-05-10 Cooperative journals: 《计算机应用研究》
Abstract: Bullens et al. left an open problems in CSI-Fish is to devise a identification protocol that allows for the challenge set to be #1;rather than the small set #1;. This paper proposed a zero-knowledge proof scheme based on supersingular isogeny. This scheme addresses the open problem by taking the challenge C as a isogeny , and reduces the soundness error and the size of public key. This scheme can be turned into non-interactive zero-knowledge proof scheme using the Fiat-Shamir transform. Then signature scheme and group signature scheme based on supersingular isogeny can be implemented under the quantum random oracles model. And this paper analyzes the security and correctness of these schemes.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-09-12 Cooperative journals: 《计算机应用研究》
Abstract: McEliece public-key cryptosystem is a public-key cryptosystem based on coding theory. Its security can be reduced to the general linear code decoding problem and it can resist quantum attack. This paper proposed an improved McEliece variant scheme based on quasi-cyclic medium density parity check (QC-MDPC) code and quasi-cyclic low density parity check (QC-LDPC) code. The main improvement was that the parity check matrices of QC-LDPC code and QC- MDPC code were combined as a private key, and the concatenated codewords generated were applied to the McEliece variant scheme, and an improved decoding algorithm was given. The analysis shows that under the 80-bit security, it has small system key and low-implement complexity. In addition, this system can resist the recently proposed key recovery attacks on QC-MDPC and QC-LDPC respectively.