一类双线性对的高效计算方案及在信息隐藏的应用

为了提高多媒体数据的基于身份加密的效率,构造计算安全的短签名与认证协议,建立一类双线性对的高效计算平台.构造一类具有确定嵌入次数的椭圆曲线,提出计算其有理点群阶的快速算法,时间复杂度比SEA,Satoh,SST 和 AGM等求阶算法更低.在此构造方案上,双线性对的计算无须借助复乘方法,总时间复杂度较低且实现容易,其结果可应用于信息隐藏领域.

Efficient Computation for a Class of Bilinear Pairings and Its Application in Information Hiding

Aiming at improving the efficiency in identity-based multimedia encryption,the computationally secure short signature and authentication protocols are constructed and a computation framework for a class of bilinear pairing is built up.A class of elliptic curves of certain embedding degrees are constructed and a fast computation algorithm for rational point group is presented.The complexity of the algorithm is less than that of the order computation algorithms such as SEA,Satoh,SST and AGM.The bilinear pairing computation,which is based on the algorithm under that construction,is more efficient and easy to implement without complex multiplication.The results can be applied in the fields such as information hiding.