1,114 research outputs found
Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications
Finding an irreducible factor, of a polynomial f(x) modulo a prime p, is not known to be in deterministic polynomial time. Though there is such a classical algorithm that counts the number of irreducible factors of f mod p. We can ask the same question modulo prime-powers p^k. The irreducible factors of f mod p^k blow up exponentially in number; making it hard to describe them. Can we count those irreducible factors mod p^k that remain irreducible mod p? These are called basic-irreducible. A simple example is in f=x^2+px mod p^2; it has p many basic-irreducible factors. Also note that, x^2+p mod p^2 is irreducible but not basic-irreducible!
We give an algorithm to count the number of basic-irreducible factors of f mod p^k in deterministic poly(deg(f),k log p)-time. This solves the open questions posed in (Cheng et al, ANTS\u2718 & Kopp et al, Math.Comp.\u2719). In particular, we are counting roots mod p^k; which gives the first deterministic poly-time algorithm to compute Igusa zeta function of f. Also, our algorithm efficiently partitions the set of all basic-irreducible factors (possibly exponential) into merely deg(f)-many disjoint sets, using a compact tree data structure and split ideals
Dedekind Zeta Functions and the Complexity of Hilbert's Nullstellensatz
Let HN denote the problem of determining whether a system of multivariate
polynomials with integer coefficients has a complex root. It has long been
known that HN in P implies P=NP and, thanks to recent work of Koiran, it is now
known that the truth of the Generalized Riemann Hypothesis (GRH) yields the
implication that HN not in NP implies P is not equal to NP. We show that the
assumption of GRH in the latter implication can be replaced by either of two
more plausible hypotheses from analytic number theory. The first is an
effective short interval Prime Ideal Theorem with explicit dependence on the
underlying field, while the second can be interpreted as a quantitative
statement on the higher moments of the zeroes of Dedekind zeta functions. In
particular, both assumptions can still hold even if GRH is false. We thus
obtain a new application of Dedekind zero estimates to computational algebraic
geometry. Along the way, we also apply recent explicit algebraic and analytic
estimates, some due to Silberman and Sombra, which may be of independent
interest.Comment: 16 pages, no figures. Paper corresponds to a semi-plenary talk at
FoCM 2002. This version corrects some minor typos and adds an
acknowledgements sectio
Complex Multiplication Tests for Elliptic Curves
We consider the problem of checking whether an elliptic curve defined over a
given number field has complex multiplication. We study two polynomial time
algorithms for this problem, one randomized and the other deterministic. The
randomized algorithm can be adapted to yield the discriminant of the
endomorphism ring of the curve.Comment: 13 pages, 2 tables, 1 appendi
Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials: The Regular Case
Let and be
two sets of nonlinear polynomials over
( being a field). We consider the computational problem of finding
-- if any -- an invertible transformation on the variables mapping
to . The corresponding equivalence problem is known as {\tt
Isomorphism of Polynomials with one Secret} ({\tt IP1S}) and is a fundamental
problem in multivariate cryptography. The main result is a randomized
polynomial-time algorithm for solving {\tt IP1S} for quadratic instances, a
particular case of importance in cryptography and somewhat justifying {\it a
posteriori} the fact that {\it Graph Isomorphism} reduces to only cubic
instances of {\tt IP1S} (Agrawal and Saxena). To this end, we show that {\tt
IP1S} for quadratic polynomials can be reduced to a variant of the classical
module isomorphism problem in representation theory, which involves to test the
orthogonal simultaneous conjugacy of symmetric matrices. We show that we can
essentially {\it linearize} the problem by reducing quadratic-{\tt IP1S} to
test the orthogonal simultaneous similarity of symmetric matrices; this latter
problem was shown by Chistov, Ivanyos and Karpinski to be equivalent to finding
an invertible matrix in the linear space of matrices over and to compute the square root in a matrix
algebra. While computing square roots of matrices can be done efficiently using
numerical methods, it seems difficult to control the bit complexity of such
methods. However, we present exact and polynomial-time algorithms for computing
the square root in for various fields (including
finite fields). We then consider \\#{\tt IP1S}, the counting version of {\tt
IP1S} for quadratic instances. In particular, we provide a (complete)
characterization of the automorphism group of homogeneous quadratic
polynomials. Finally, we also consider the more general {\it Isomorphism of
Polynomials} ({\tt IP}) problem where we allow an invertible linear
transformation on the variables \emph{and} on the set of polynomials. A
randomized polynomial-time algorithm for solving {\tt IP} when
is presented. From an algorithmic point
of view, the problem boils down to factoring the determinant of a linear matrix
(\emph{i.e.}\ a matrix whose components are linear polynomials). This extends
to {\tt IP} a result of Kayal obtained for {\tt PolyProj}.Comment: Published in Journal of Complexity, Elsevier, 2015, pp.3
- …