425 search results - page 21 / 85 » Polynomial Factorization 1987-1991 |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
IJNSEC
2008
13 years 7 months ago
2008
In1985, Shmuley proposed a theorem about intractability of Composite Diffie-Hellman. The theorem of Shmuley may be paraphrased as saying that if there exist a probabilistic polyno...
CASC
2005
Springer
14 years 29 days ago
2005
Springer
The behavior of the Cayley-Dixon resultant construction and the structure of Dixon matrices are analyzed for composed polynomial systems constructed from a multivariate system in w...
CC
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
EUROCRYPT
2005
Springer
14 years 28 days ago
2005
Springer
We present a new and flexible formulation of Coppersmith’s method for finding small solutions of bivariate polynomials p(x, y) over the integers. Our approach allows to maximiz...