34 search results - page 1 / 7 » Implicit Factoring: On Polynomial Time Factoring Given Only ... |
PKC
2009
Springer
14 years 5 months ago
2009
Springer
We address the problem of polynomial time factoring RSA moduli N1 = p1q1 with the help of an oracle. As opposed to other approaches that require an oracle that explicitly outputs b...
PKC
2010
Springer
13 years 7 months ago
2010
Springer
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
ASIACRYPT
2008
Springer
13 years 7 months ago
2008
Springer
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
AAECC
2007
Springer
13 years 5 months ago
2007
Springer
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...