Approximatting rings of integers in number fields.
@article{Buchmann1994ApproximattingRO, title={Approximatting rings of integers in number fields.}, author={J. Buchmann and H. Lenstra}, journal={Journal de Theorie des Nombres de Bordeaux}, year={1994}, volume={6}, pages={221-260} }
In this paper we study the algorithmic problem of finding the ring of integers of a given algebraic mimber field. In practice, this problem is often considered to be well-solved, but theoretical results indicate that it is intractable for number fields that are defined by equations with very large coefficients. Such fields occur in the number field sieve algorithm for facto- ring integers. Applying a variar.t of a Standard algorithm for finding rings of integers, one finds a subring of the… Expand
50 Citations
Deciding properties of polynomials without factoring
- Mathematics, Computer Science
- Proceedings 38th Annual Symposium on Foundations of Computer Science
- 1997
- 1
Factoring into coprimes in essentially linear time
- Mathematics, Computer Science
- J. Algorithms
- 2005
- 47
- PDF
References
SHOWING 1-10 OF 48 REFERENCES
A course in computational algebraic number theory
- Computer Science, Mathematics
- Graduate texts in mathematics
- 1993
- 2,610
Some Remarks on Computing the Square Parts of Integers
- Computer Science, Mathematics
- Inf. Comput.
- 1988
- 18