Computing endomorphism rings of abelian varieties of dimension two
Number Theory
2013-10-16 v2
Abstract
Generalizing a method of Sutherland and the author for elliptic curves, we design a subexponential algorithm for computing the endomorphism rings of ordinary abelian varieties of dimension two over finite fields. Although its correctness and complexity analysis rest on several assumptions, we report on practical computations showing that it performs very well and can easily handle previously intractable cases.
Keywords
Cite
@article{arxiv.1209.1189,
title = {Computing endomorphism rings of abelian varieties of dimension two},
author = {Gaetan Bisson},
journal= {arXiv preprint arXiv:1209.1189},
year = {2013}
}
Comments
14 pages, 2 figures