基于乘法群Zp^＊的ELGamal公钥密码系统  

ELGamal public key cryptosystem based on multiplicative group Zp^＊

作　　者：孙立宏[1] 

机构地区：[1]阜新高等专科学校师范部,辽宁阜新123000

出　　处：《辽宁工程技术大学学报（自然科学版）》2011年第3期464-467,共4页Journal of Liaoning Technical University (Natural Science)

基　　金：辽宁省教育厅高等学校科学研究基金资助项目(202182054)

摘　　要：为了解决发送方与接收方不能识别对方身份的问题,在研究ElGamal密码体制的基础上,给出了一种基于乘法群Zp*的ELGamal公钥密码体制。结果表明:该算法可以实现通信双方的双向身份认证,有效地防止了攻击者冒充发送方伪造要发送的消息。同时该算法在通信过程中加入了可以追踪消息来源的信息,使得接收者可以对消息的真实性进行有效的验证。通过对消息的双重保护,该体制实现了在公开信道上的安全通信。In the public key cryptography system, the sender encrypts the messages with the recipient＇s public key and the receiver decrypts them with their own secret key, which results in that the two sides are unable to recognize each other. In order to solve the problem above, an ELGamal public key cryptosystem based on multiplicative group Zp＊ has been presented in this paper. The bidirectional identity authentication between both communications sides are supplied in the proposed algorithm, which successfully prevents the attacker sending a forged message in the identity of sender. In addition, the algorithm also adds the information to track the sources of message in the communication process, which allows the message recipients verifying the authenticity of message effectively. The system imolements a secured communication in the public channel through a dual protection on message.

关 键 词：乘法群 ELGAMAL 有限循环群 Pohlig-Hellman算法 公钥密码系统 

分 类 号：O236[理学—运筹学与控制论]