73 search results - page 2 / 15 » On the Complexity of Solving a Bivariate Polynomial System |
FOCM
2010
13 years 2 months ago
2010
In [BP08], the average complexity of linear homotopy methods to solve polynomial equations with random initial input (in a sense to be described below) was proven to be finite, an...
MOC
2011
13 years 6 days ago
2011
We present a new technique, based on polynomial continuation, for solving systems of n polynomials in N complex variables. The method allows equations to be introduced one-by-one o...
CORR
1998
Springer
13 years 4 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
ACNS
2011
Springer
12 years 9 months ago
2011
Springer
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
EUROCRYPT
2012
Springer
11 years 7 months ago
2012
Springer
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...