Constructing Polynomials for Generating Pairingfriendly Elliptic Curves
返回论文页
|更新时间:2023-12-11
|
Constructing Polynomials for Generating Pairingfriendly Elliptic Curves
Acta Scientiarum Naturalium Universitatis SunYatseniVol. 49, Issue 4, Pages: 30-32(2010)
作者机构:
西安电子科技大学计算机网络与信息安全教育部重点实验室,陕西,西安,710071
作者简介:
基金信息:
DOI:
CLC:
Published:2010,
Published Online:25 July 2010,
扫 描 看 全 文
Constructing Polynomials for Generating Pairingfriendly Elliptic Curves. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 49(4):30-32(2010)
DOI:
Constructing Polynomials for Generating Pairingfriendly Elliptic Curves. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 49(4):30-32(2010)DOI:
Constructing Polynomials for Generating Pairingfriendly Elliptic Curves
the curve parameters are often represented by polynomials with rational coefficients. For efficiently generating the curves parameters
the degree of the complex multipliction polynomial must be less than 3. A method is proposed to constructed suitable polynomials which will make the degree of the complex multipliction polynomial less than 3. Some examples are given
especially when embedding degree is 8. It is generally believed that when embedding degree is 8 the complex multipliction polynomial whose degree is less than 3 does not exist.