Expanding the use of quasi-subfield polynomials

09/25/2019
by   M. Euler, et al.
0

The supposed hardness of the elliptic curve discrete logarithm problem is crucial for modern cryptographic protocols. In 2018, the article "Quasi-subfield polynomials and the elliptic curve discrete logarithm problem" by Huang et al. highlighted the potential of a specific class of polynomials to solve this problem at lower cost. Following different tracks that were mentioned in this article, we were able to prove new results: we have exhibited and proved five more families of quasi-subfield polynomials. They are based on additive groups and multiplicative groups. Nonetheless, none of the found families allows us to beat already known ECDLP algorithms. We explained this obstruction in the case of linearized polynomials by proving a new tight lower bound. Finally, we briefly discuss how other algebraic groups could be used in this context.

READ FULL TEXT

page 1

page 26

page 27

research
05/11/2020

Initial minors – a conjecture to solve the elliptic curve discrete logarithm problem

The purpose of this paper is to propose a paradigm shift in attacking th...
research
09/19/2019

A New Method for Geometric Interpretation of Elliptic Curve Discrete Logarithm Problem

In this paper, we intend to study the geometric meaning of the discrete ...
research
02/10/2022

Robust Sylvester-Gallai type theorem for quadratic polynomials

In this work, we extend the robust version of the Sylvester-Gallai theor...
research
12/04/2022

Pairing-Friendly Elliptic Curves: Revisited Taxonomy, Attacks and Security Concern

Major families of pairing-friendly elliptic curves, including BN, BLS12,...
research
12/13/2020

Cover attacks for elliptic curves with prime order

We give a new approach to the elliptic curve discrete logarithm problem ...
research
07/05/2019

Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms

Elliptic bases, introduced by Couveignes and Lercier in 2009, give an el...
research
04/22/2021

On the period collapse of a family of Ehrhart quasi-polynomials

A graph whose nodes have degree 1 or 3 is called a {1,3}-graph. Liu and ...

Please sign up or login with your details

Forgot password? Click here to reset