Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem

Journal of mathematical cryptology

article

Ming-Deh Huang¹  Michiel Kosters²  Christophe Petit³  Sze Ling Yeo⁴  Yang Yun⁵ 

[1] University of Southern California, United States of America;University of California, United States of America;University of Birmingham, United Kingdom of Great Britain and Northern Ireland;Institute for Infocomm Research (I2R) and Nanyang Technical University;School of science, Jinling Institute of Technology

关键词: Elliptic Curve Discrete Logarithm Problem;    Cryptanalysis;    Finite Fields;   

DOI  :  10.1515/jmc-2015-0049

学科分类：社会科学、人文和艺术（综合）

来源: De Gruyter

【 摘 要 】

We initiate the study of a new class of polynomials which we call quasi-subfield polynomials. First, we show that this class of polynomials could lead to more efficient attacks for the elliptic curve discrete logarithm problem via the index calculus approach. Specifically, we use these polynomials to construct factor bases for the index calculus approach and we provide explicit complexity bounds. Next, we investigate the existence of quasi-subfield polynomials.

【 授权许可】

CC BY|CC BY-NC-ND