Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Fast algorithms for computing isogenies between ordinary elliptic curves
  in small characteristic   The problem of computing an explicit isogeny between two given elliptic
curves over F_q, originally motivated by point counting, has recently awaken
new interest in the cryptology community thanks to the works of Teske and
Rostovstev & Stolbunov.
  While the large characteristic case is well understood, only suboptimal
algorithms are known in small characteristic; they are due to Couveignes,
Lercier, Lercier & Joux and Lercier & Sirvent. In this paper we discuss the
differences between them and run some comparative experiments. We also present
the first complete implementation of Couveignes' second algorithm and present
improvements that make it the algorithm having the best asymptotic complexity
in the degree of the isogeny.

27
The categories of this paper are: comp-gas
21
The categories of this paper are: adap-org
13
The categories of this paper are: quant-ph
30
The categories of this paper are: q-alg
9
The categories of this paper are: nlin
22
The categories of this paper are: chao-dyn
5
The categories of this paper are: gr-qc
24
The categories of this paper are: dg-ga
26
The categories of this paper are: bayes-an
20
The categories of this paper are: acc-phys
8
The categories of this paper are: hep-ex
35
The categories of this paper are: mtrl-th
18
The categories of this paper are: econ
14
The categories of this paper are: math-ph
3
The categories of this paper are: physics
15
The categories of this paper are: nucl-ex