摘要
基于Ｚｎ＊中二次剩余问题，Ｇｏｌｄｗａｓｓｅｒ与Ｍｉｃａｌｉ［１］首先提出了一种具有多项式安全的概率公开钥密码体制。由此几种基于Ｚｎ＊中γ—次剩余问题的概率加密体制也被建立起来（本文称之为广义ＧＭ体制）。概率公开钥密码体制只有是多项式安全的，才能体现它作为一种概率加密体制所特有的特点，但广义ＧＭ体制的多项式安全性并没有得到证明。本文用较独特的方法证明了广义ＧＭ体制是多项式安全的。
Based on the quadratic residue problem, Goldwasser and Micali first presented a probabilistic public key cryptosystem which is polynomial secure. From this, a few probabilistic public key cryptosystems based on the γ th residue problem were also constructed (we call them as generalized GM cryptosystems). When probabilistic public key cryptosystem is polynomial secure, it can reveal the peculiar characteristic of probabilistic encryption. The generalized GM cryptosystems aren't proven that they are polynomial secure. In this paper, we use a new method to show that generalized GM cryptosystems are polynomial secure.
出处
《通信学报》
EI
CSCD
北大核心
1996年第5期35-40,共6页
Journal on Communications
关键词
公钥密码体制
概率加密
多项式
安全性
public key cryptosystem, probabilistic encryption, expansion, polynomial secure
