Using partial smoothness of p-1 for factoring polynomials modulo p

نویسنده

  • Bartosz Zralek
چکیده

Let an arbitrarily small positive constant δ less than 1 and a polynomial f with integer coefficients be fixed. We prove unconditionally that f modulo p can be completely factored in deterministic polynomial time if p− 1 has a (ln p)O(1)-smooth divisor exceeding pδ. We also address the issue of factoring f modulo p over finite extensions of the prime field Fp and show that p− 1 can be replaced by pk − 1 (k ∈ N) for explicit classes of primes p.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Polynomial Operations on SMPs: an Overview

1 SMP-based parallel algorithms and implementations for polynomial factoring and GCD are overviewed. Topics include polynomial factoring modulo small primes, univariate and multivariate p-adic lifting, and reformulation of lift basis. Sparse polynomial GCD is also covered.

متن کامل

Smoothness and Factoring Polynomials Over Finite Fields

Let p be a prime number, and F p the nite eld with p elements. Let S(m) be the \smoothness" function that for integers m is deened as the largest prime divisor of m. In this note, we prove the following theorem. Theorem. There is a deterministic algorithm for factoring polynomials over F p , which on poly-nomials over F p of degree n runs in time S(p ? 1) 1=2 (n log p) O(1) under the assumption...

متن کامل

Fast Hensel's lifting implementation using partial fraction decomposition

When factoring polynomials defined over Z[x], one computes the factors modulo m from the factors modulo p, where p is a suitable prime number and m a power of p, greater than rn, a bound on the absolute value of the coefficient of any factor of the polynomial. This is done using the Hensel lemma. We present a new way to perform this lifting process based on the idea of partial fraction decompos...

متن کامل

A New Polynomial Factorization Algorithm and its Implementation

We consider the problem of factoring univariate polynomials over a nite eld. We demonstrate that the new baby step/giant step factoring method, recently developed by Kaltofen & Shoup, can be made into a very practical algorithm. We describe an implementation of this algorithm, and present the results of empirical tests comparing this new algorithm with others. When factoring polynomials modulo ...

متن کامل

Factoring Hecke Polynomials modulo A

Let T N,χ p,k (x) be the characteristic polynomial of the Hecke operator T p acting on the space of cusp forms S k (N, χ). We describe the factorization of T N,χ p,k (x) mod as k varies, and we explicitly calculate those factorizations for N = 1 and small. These factorizations are used to deduce the irreducibility of certain T 1,1 q,k (x) from the irreducibility of T 1,1 2,k (x).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Comput.

دوره 79  شماره 

صفحات  -

تاریخ انتشار 2010