摘要
基于Z_(n,a)中P_i一次剩余问题,1≤i≤t,本文建立了一种以Z_(n,a)中离散对数为形式的概率加密体制,其中n=pq,a为Z_n^(?)中伪原根。该密码体制的信息膨胀率约为1:2.在Z_(n,a)中P_i一次剩余问题是困难的条件假设下,1≤i≤t,本体制是多项式安全的。
Based on the pi-th residue problem, 1≤i≤t, this paper presents a probabilistic encryption scheme in the form of discrete logarithm for Zn,a(n = pq, a is a pseudogenerator in Zn ). The message expansion of the cryptosystem is 1 : 2. Under the pi - th (1≤i≤t) resicluosity assump-tion, the cryptosystem is polynomial secure.
出处
《信息安全与通信保密》
1996年第3期62-66,共5页
Information Security and Communications Privacy
关键词
离散对象
概率加密体制
膨胀率
多项式安全
Discrete logarithm Probabilistic encryption scheme Expansion Polynomial secure
