高效的基于双难问题的多重签密方案

Efficient Multiple Signcryption Scheme Based on Two Hard Problems

基于整数环Z n上圆锥曲线的多重签名思想,提出了一种高效的整数环Z n上圆锥曲线的多重签密方案.在基于大整数分解和圆锥曲线离散对数的双重困难问题下对方案的安全性进行了证明.该方案中的签密和解签密运算是在圆锥曲线上进行的,因此明文嵌入方便,求逆简单,元素阶的计算及曲线上点的运算均更加容易.与现有方案的效率进行对比,提出的多重签密方案在信息运算量方面有极大的改进.

A scheme for efficient multiple signcryption on the conic curve over the ring Zn is presented based on multiple digital signature. The security of the proposed scheme is proved based on the two hard problems of large integer faetorization and discrete logarithm on conic curve. As the signeryption and designcryption are calculated on conic curve, plaintexts can be embedded easily, and in inverse, the element order and points＇ operation on conic curve over can be calculated more simply and easily in the pro- posed scheme. Compared with the exiting scheme in efficiency, the proposed scheme is greatly improved in information computation.