A new lifting process for the multivariate polynomial factorization

2005 ◽  
pp. 297-309 ◽  
Author(s):  
D. Lugiez
Keyword(s):  
Polynomial Factorization ◽  
Multivariate Polynomial

Multivariate Polynomial Factorization

1975 ◽  
Vol 22 (2) ◽  
pp. 291-308 ◽  
Author(s):  
David R. Musser
Keyword(s):  
Polynomial Factorization ◽  
Multivariate Polynomial

Multivariate Polynomial Factorization

2021 ◽  
Vol 11 (06) ◽  
pp. 1257-1262
Author(s):  
东旭 吕
Keyword(s):  
Polynomial Factorization ◽  
Multivariate Polynomial

scholarly journals Can we Beat the Square Root Bound for ECDLP over 𝔽p2 via Representation?

2020 ◽  
Vol 14 (1) ◽  
pp. 293-306
Author(s):  
Claire Delaplace ◽  
Alexander May
Keyword(s):  
Elliptic Curve ◽  
Quadratic Field ◽  
Discrete Logarithm ◽  
Field Size ◽  
Square Root ◽  
Multivariate Polynomial ◽  
Bivariate Polynomial ◽  
Testing Problem ◽  
Polynomial Zero ◽  
Representation Technique

AbstractWe give a 4-list algorithm for solving the Elliptic Curve Discrete Logarithm (ECDLP) over some quadratic field 𝔽p2. Using the representation technique, we reduce ECDLP to a multivariate polynomial zero testing problem. Our solution of this problem using bivariate polynomial multi-evaluation yields a p1.314-algorithm for ECDLP. While this is inferior to Pollard’s Rho algorithm with square root (in the field size) complexity 𝓞(p), it still has the potential to open a path to an o(p)-algorithm for ECDLP, since all involved lists are of size as small as $\begin{array}{} p^{\frac 3 4}, \end{array}$ only their computation is yet too costly.

Comments on "Polynomial factorization using the Routh criterion"

1972 ◽  
Vol 60 (4) ◽  
pp. 471-471
Author(s):  
A.M. Davis ◽  
E. Mastascusa ◽  
W. Rave ◽  
B. Turner
Keyword(s):  
Polynomial Factorization
Sign in / Sign up

Export Citation Format

Share Document