电子科技大学学报2011，Vol.40Issue(3)：392-395,4.DOI:10.3969/j.issn.1001-0548.2011.03.013
双线性对快速计算中的多项式选取
Polynomials for Pairing Computation
摘要
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.关键词
椭圆曲线/循环次数/双线性对/双线性对计算/多项式Key words
elliptic curve/ loop length/ pairing/ pairing computation/ polynomial分类
信息技术与安全科学引用本文复制引用
苏志图,李晖,马建峰..双线性对快速计算中的多项式选取[J].电子科技大学学报,2011,40(3):392-395,4.基金项目
国家自然科学基金(60772136,60633020) （60772136,60633020）
国家863计划(2007AA01Z435) （2007AA01Z435）
