论文部分内容阅读
零知识证明是密码学关注的问题之一。在可判定条件下,运用代数学中群的共轭性质进行零知识证明,其实例就是数学中关于寻找共轭子的困难性问题。
Zero-knowledge proof is one of the problems in cryptography. The use of algebra in the conjugate nature of the proof of zero knowledge under decidable conditions, the example is the mathematical difficulties in finding conjugates.