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]
< Leer menos
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Idioma
en
Communication dans un congrès
Este ítem está publicado en
Algorithmic Number Theory Symposium ANTS XI, 2014-08-06, GyeongJu. 2014, vol. 17, p. 366-384
Resumen en inglés
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 ...Leer más >
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.< Leer menos
Palabras clave en inglés
Bruhat-Tits tree
factor base
principal ideal algorithm
quaternion algebra
Proyecto europeo
Algorithmic Number Theory in Computer Science
Orígen
Importado de HalCentros de investigación