基于复合问题的有序多重签名算法

数字签名对网络分布式系统中的密钥分配、认证、认可中具有重要作用．文章提出了一种基于RSA的E1Gamal型有序多重数字签名方案，由多人参与对同一文件进行分别签名，攻击者若想从每个用户的公钥中求解私钥，这相当于求解离散对数问题，同样攻击者若要从每一位签名者公开传送的公钥中求解随机数也是求解离散对数悯题．使得在构造签名方案安全性的同时满足了大数分解和离散对数复合问题．利用RSA对消息的加密，避免了消息采用明文的形式发送，保证了信息的机密性．

Research on complex digital multi-signature schemes

Distributed digital signature system on the network key distribution,certification,accreditation plays an important role.Based on RSA′s multi-E1Gama1 type digital signature scheme in an orderly manner,the same documents were signed by the people involved,if an attacker from the user′s public key solves of the private key,that is equivalent to solving the discrete logarithm question,the same attacker to open each and every signer′s public key to send the random number is also in solving the discrete logarithm problem to solve.Signature program makes structural safety of large numbers,at the same time,satisfies the decomposition and the discrete logarithm problem complex.The use of RSA encryption on the message avoids the use of explicit message sent, and ensures the confidentiality of information.