| 双线性对快速计算中的多项式选取 |
| |
| 引用本文： | 苏志图,李晖,马建峰.双线性对快速计算中的多项式选取[J].电子科技大学学报(社会科学版),2011(3). |
| |
| 作者姓名： | 苏志图 李晖 马建峰 |
| |
| 作者单位： | 西安电子科技大学计算机网络与信息安全教育部重点实验室; |
| |
| 基金项目： | 国家自然科学基金(60772136,60633020); 国家863计划(2007AA01Z435) |
| |
| 摘 要： | 针对Miller算法的循环次数,分析了循环控制多项式的性质,得出某些类的循环控制多项式的次数的下限。在此基础上,给出适合于双线性对的椭圆曲线的相关参数的选取方法。最后,给出利用不可约分因子来生成适合于双线性对的椭圆曲线时,Miller算法的循环次数达到理论下限的充分必要条件。
|
| 关 键 词： | 椭圆曲线 循环次数 双线性对 双线性对计算 多项式 |
Polynomials for Pairing Computation |
| |
| SU Zhi-tu,LI Hui, MA Jian-feng.Polynomials for Pairing Computation[J].Journal of University of Electronic Science and Technology of China(Social Sciences Edition),2011(3). |
| |
| Authors: | SU Zhi-tu LI Hui MA Jian-feng |
| |
| Institution: | SU Zhi-tu,LI Hui,and MA Jian-feng(Key Laboratory of Computer Networks and Information Security of Ministry of Education,Xidian University Xi'an 710071) |
| |
| Abstract: | In Miller's algorithm,the loop length plays an important role.By analyzing the loop control polynomial,the lower bound for the degree of some class of control polynomial is derived.Based on the lower bound,the method for selecting proper curve parameters for constructing pairing-friendly elliptic curve is proposed.Finally,when irreducible polynomial is used to generate pairing-friendly elliptic curve,the necessary and sufficient condition for the loop length reaching the lower bound is presented. |
| |
| Keywords: | elliptic curve loop length pairing pairing computation polynomial |
| 本文献已被 CNKI 等数据库收录！ |
