J. A. Buchmann and C. S. Hollinger, On smooth ideals in number fields, J. Number Theory 59 (1996), 82--87. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Discrete logarithms: The past and the future - Odlyzko (1999) (6 citations) (Correct)
....That assumption has been verified extensively by computations of smooth elements, as well as by the success of the integer fac9 torization and discrete log algorithms that depend on it. For recent results on smoothness of integers, see [HildebrandT] and on smoothness of algebraic integers, see [BuchmannH]. The latest results on smoothness of polynomials are in [PanarioGF] See also [GarefalakisP1, GarefalakisP2] for more general results on polynomial factorization. Smoothness estimates of this type are also crucial for the the few rigorous proofs of running times of probabilistic algorithms. ....
J. A. Buchmann and C. S. Hollinger, On smooth ideals in number fields, J. Number Theory 59 (1996), 82--87.
Discrete Logarithms and Smooth Polynomials - Odlyzko (1993) (10 citations) (Correct)
....There is a huge literature on smooth integers, since they are of interest in many other applications besides discrete logarithm and factorization algorithms. A detailed survey of this area is presented in [18] Distribution of smooth ideals is less well understood. For recent results, see [5]. To some extent DISCRETE LOGARITHMS AND SMOOTH POLYNOMIALS 7 problems about smooth ideals can be transformed into problems about smooth integers. The distribution of smooth polynomials (over finite fields) is much easier to study than that of smooth integers. However, for a long time there was ....
J. A. Buchmann and C. S. Hollinger, On smooth ideals in number fields, to be published.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC