Quasi-subfield polynomials and the elliptic curve discrete logarithm problem
Research output: Contribution to journal › Article
Authors
Colleges, School and Institutes
External organisations
- University of Southern California
- University of California, Irvine
- Institute for Infocomm Research, Singapore
- Nanyang Technical University
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.
Details
Original language | English |
---|---|
Number of pages | 21 |
Journal | Journal of Mathematical Cryptology |
Publication status | Accepted/In press - 28 Nov 2018 |
Keywords
- Elliptic Curve Discrete Logarithm Problem, Cryptanalysis, Finite fields