基于椭圆曲线的两种双线性配对算法  

Two Bilinear Pairing Algorithms Based on Elliptic Curves

作　　者：王向阳[1] 赵泽茂[1] 陈丽萍[1] 

机构地区：[1]杭州电子科技大学通信工程学院,浙江杭州310018

出　　处：《计算机工程与科学》2009年第2期50-52,共3页Computer Engineering & Science

基　　金：浙江省教育厅资助项目(20060247)

摘　　要：双线性配对在密码学中得到了越来越广泛的应用,用它来构建的签名方案具有速度快、密钥短和签名短等优点。针对双线性配对基础算法中的点乘和求有理函数,本文提出两种基于椭圆曲线的双线性配对算法。这两种双线性配对算法与Miller算法、三进制Miller算法相比,所需乘除法次数少、效率高。In recent years, bilinear pairing is widely applied in cryptography , and the signature scheme based on bilinear pairing has the advantages of fast computation, short signature and short key. In this paper, two bilinear pairing algorithms based on elliptic curves are proposed. Compared with the Miller＇s algorithm and the ternary Miller＇s algorithm, the two hilinear pairing algorithms have the fewest number of multiplications and divisions, and have the highest efficiency.

关 键 词：双线性配对Weil配对 TATE配对 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]