Incollection,

An analytic approach to smooth polynomials over finite fields

, , and .
Algorithmic Number Theory, volume 1423 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (1998)
DOI: 10.1007/BFb0054865

Abstract

We consider the largest degrees that occur in the decomposition of polynomials over finite fields into irreducible factors. We expand the range of applicability of the Dickman function as an approximation for the number of smooth polynomials, which provides precise estimates for the discrete logarithm problem. In addition, we characterize the distribution of the two largest degrees of irreducible factors, a problem relevant to polynomial factorization. As opposed to most earlier treatments, our methods are based on a combination of exact descriptions by generating functions and a specific complex asymptotic method.

Tags

Users

  • @keinstein

Comments and Reviews