ANTS 1998: Algorithmic Number Theory pp 299-310 | Cite as
Reducing ideal arithmetic to linear algebra problems
Conference paper
First Online:
Abstract
In this paper, we will show a reduction of ideal arithmetic, or more generally, of arithmetic of ZZ-modules of full rank in orders of number fields to problems of linear algebra over ZZ/mZZ, where m is a possibly composite integer. The problems of linear algebra over ZZ/mZZ will be solved directly, instead of either “reducing” them to problems of linear algebra over ZZ or factoring m and working modulo powers of primes and applying the Chinese Remainder theorem.
Preview
Unable to display preview. Download preview PDF.
References
- [BoSh66]Z.I. Borevich, I.R. Shafarevich, Number Theory, Academic Press, New York and London, 1966Google Scholar
- [Coh95]H. Cohen, A Course in Computational Algebraic Number Theory, 2nd corrected printing, Springer, Heidelberg, München, New York, 1995Google Scholar
- [BuNe97]J. Buchmann, S. Neis, Algorithms for Linear Algebra Problems over Principal Ideal Rings, submitted to SIAM Journal of ComputingGoogle Scholar
- [H086]J.A. Howell, Spans in the Module (ZZ m)s, Lin. Mult. Alg. 19, 1986, pg. 67–77MATHMathSciNetGoogle Scholar
- [KASH]M. Pohst, KAnt SHell (Version 1.9), TU BerlinGoogle Scholar
- [LiDIA]The LiDIA Group, LiDIA — a library for computational number theory, TU DarmstadtGoogle Scholar
- [GP]C. Batut, D. Bernardi, H. Cohen, M. Olivier, GP/PARI CALCULATOR Version 1.39, Université Bordeaux IGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1998