90 search results - page 1 / 18 » Schemes for deterministic polynomial factoring |
ISSAC
2009
Springer
13 years 11 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
JOC
2007
13 years 4 months ago
2007
Abstract. We address one of the most fundamental problems concerning the RSA cryptosystem: does the knowledge of the RSA public and secret key-pair (e, d) yield the factorization o...
PKC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
CRYPTO
2004
Springer
13 years 10 months ago
2004
Springer
JSC
2007
13 years 4 months ago
2007
We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several to one variable. The deterministic algorithm runs in sub-...