摘要
本文讨论了Ｚｎ＊（ｎ＝ｐｑ，ｐ和ｑ未知）中离散对数问题的一些基本概念及问题本身的难度；定义了Ｚｎ＊中离散对数问题中关于判断主平方根的谓词Ｂｎ，ａ（ｘ），证明了谓词Ｂｎ，ａ（ｘ）即为Ｚｎ＊中离散对数问题的安全谓词．
This paper defines the discrete logarithm problem for Zn* (n = pq,p and q are unknown primes),the difficulty of which is equivalent to factoring n and solving the discrete logarithm problems for Zp* and Zq*. The definition of a boolean predicate is also given to predict the principal square root. The predicate is polynomial-secure,provided that the discrete logarithm problem is hard.
出处
《计算机学报》
EI
CSCD
北大核心
1995年第3期205-211,共7页
Chinese Journal of Computers
关键词
离散对数问题
安全谓词
密码学
密码体制
Discrete logarithm problem,pseudo-generator, secure predicate.
