Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem
Huang Ming-Deh, Kosters Michiel, Petit Christophe and 2 more
Journal of Mathematical Cryptology · 2020
doi:10.1515/jmc-2015-0049 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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.
Abstract licence: CC BY
References7
7 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.