破译RSA能力的零知识证明的改进方案

Improving Solution to Zero-knowledge Proving of Decoding RSA Capability

Schneier在参考文献[1]中提出了一种破译RSA的能力的零知识证明,该方案在零知识证明破译RSA的能力时,证明过程有些问题,并且它也不能确认是谁破译了RSA。该方案针对上述问题对Schneier方案进行了一些改动,并对假设前提稍作了变化,并去掉了一次随机数的协商步骤;它不但给出了一种破译RSA的能力的零知识证明。

s:Schneier puts forward a zero-knowledge proof which can decode RSA.But there is something wrong with the proving process when the zero-knowledge proves the capability of decoding RSA.Meanwhile it can not make clear who decodes RSA.This solution makes some changes to the Schneier solution according to the above -mentioned problems ,such as adjusting the precondition,removing one consulting step of random number.This solution not only offers zero-knowledge proof which can decode RSA,but also shows the validater who decodes RSA through digital signature.