par Huang, Ming Deh;Kosters, Michiel;Petit, Christophe ;Yeo, Sze Ling;Yun, Yang
Référence Journal of Mathematical Cryptology, 14, 1, page (25-38)
Publication Publié, 2020-01-01
Article révisé par les pairs
Résumé : 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.