The system will be going down for regular maintenance. Please save your work and logout.
An algorithm for the principal ideal problem in indefinite quaternion algebras
PAGE, Aurel
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
PAGE, Aurel
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
< Reduce
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Language
en
Communication dans un congrès
This item was published in
Algorithmic Number Theory Symposium ANTS XI, 2014-08-06, GyeongJu. 2014, vol. 17, p. 366-384
English 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 ...Read more >
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.Read less <
English Keywords
Bruhat-Tits tree
factor base
principal ideal algorithm
quaternion algebra
European Project
Algorithmic Number Theory in Computer Science
Origin
Hal imported