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
A Montgomery-Like Square Root for the Number Field Sieve
  • 32
Deciding properties of polynomials without factoring
  • T. Sander, A. Shokrollahi
  • Mathematics, Computer Science
  • Proceedings 38th Annual Symposium on Foundations of Computer Science
  • 1997
  • 1
Theoretical concept of number fields theory
Factoring into coprimes in essentially linear time
  • 47
  • PDF
Quadratic forms and quaternion algebras: algorithms and arithmetic
  • 18
  • PDF
Descents on curves of Genus 1
  • 14
  • PDF
Algorithms for finite rings
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 48 REFERENCES
A rigorous time bound for factoring integers
  • 118
  • PDF
Factoring integers with elliptic curves
  • 1,010
The Development of the Number Field Sieve
  • 331
A course in computational algebraic number theory
  • H. Cohen
  • Computer Science, Mathematics
  • Graduate texts in mathematics
  • 1993
  • 2,609
Factoring polynomials with rational coefficients
  • 3,756
  • PDF
Some Remarks on Computing the Square Parts of Integers
  • S. Landau
  • Computer Science, Mathematics
  • Inf. Comput.
  • 1988
  • 18
Algorithms in algebraic number theory
  • 158
  • PDF
Factor refinement
  • 48
...
1
2
3
4
5
...