Article contents
An algorithm for the principal ideal problem in indefinite quaternion algebras
Published online by Cambridge University Press: 01 August 2014
Abstract
Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the underlying number field. Finding a generator is hard, and we present a heuristically subexponential algorithm.
- Type
- Research Article
- Information
- LMS Journal of Computation and Mathematics , Volume 17 , Special Issue A: Algorithmic Number Theory Symposium XI , 2014 , pp. 366 - 384
- Copyright
- © The Author 2014
References
- 3
- Cited by