论文部分内容阅读
文章研究了不可否认签名方案和RSA机制,在此基础上提出一种改进的不可否认签名算法,包括产生签名、确认协议和否认协议三个部分。改进的算法进一步减化了确认协议和否认协议的传递次数及其运算复杂度,在确保安全性的基础上,提高了签名的速度,使时间效率得到更大的提升。RSA数字签名原理在数字签名中应用较为广泛的是RSA算法。它的一个密钥对由两个素数经过运算产生。一个作为公钥,为众多实体所知;另一个作为私钥,以确保它的完整性和保密性,并且该秘钥控制严格,只有所有者才能使用。该算法最基本的特征是用密钥对中的一个密钥加密消息后,必须用另外一个解密,从而将RSA系统的非对称性体现出来。
In this paper, the undeniable signature scheme and RSA mechanism are studied. Based on this, an improved non-repudiation signature algorithm is proposed, including three parts: generating signature, confirming protocol and denying protocol. The improved algorithm further reduces the delivery times and computational complexity of the confirming protocol and the deny protocol, and increases the speed of signing based on the assurance of security, so that the time efficiency is greatly improved. RSA digital signature principle is widely used in digital signatures RSA algorithm. One of its key pairs is generated by two prime numbers. One as a public key, known to many entities; the other as a private key to ensure its integrity and confidentiality, and that the key is tightly controlled and available only to the owner. The most basic feature of this algorithm is that after encrypting a message with a key in the key pair, it must be decrypted by another key, so as to reflect the asymmetry of the RSA system.