Abstract
This paper presents an investigative account of arbitrary cubic function fields. We present an elementary classification of the signature of a cubic extension of a rational function field of finite characteristic at least five; the signature can be determined solely from the coefficients of the defining curve. We go on to study such extensions from an algorithmic perspective, presenting efficient arithmetic of reduced ideals in the maximal order as well as algorithms for computing the fundamental unit(s) and the regulator of the extension.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amrita, S.: Construction of secure C ab curves using modular curves. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 113–126. Springer, Heidelberg (2000)
Bauer, M.L.: The arithmetic of certain cubic function fields. Math. Comp. 73, 387–413 (2004)
Buchmann, J.A.: A generalization of Voronoi’s algorithm I, II. J. Number Theory 20, 177–209 (1985)
Delone, B.N., Fadeev, D.K.: The Theory of Irrationalities of the Third Degree. Transl. Math. Monographs 10, Amer. Math. Soc., Providence, Rhode Island (1964)
Galbraith, S.D., Paulus, S., Smart, N.P.: Arithmetic on superelliptic curves. Math. Comp. 71, 393–405 (2002)
Lee, Y., Scheidler, R., Yarrish, C.: Computation of the fundamental units and the regulator of a cyclic cubic function field. Exper. Math. 12, 211–225 (2003)
Lee, Y.: The unit rank classification of a general cubic function field by its discriminant (preprint)
Llorente, P., Nart, E.: Effective determination of the decomposition of the rational primes in a cuvic field. Proc. Amer. Math. Soc. 87, 579–585 (1983)
Rosen, M.: Number Theory in Function Fields. Springer, New York (2002)
Scheidler, R.: Reduction in purely cubic function fields of unit rank one. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 515–532. Springer, Heidelberg (2000)
Scheidler, R.: Ideal arithmetic and infrastructure in purely cubic function fields. J. Thèorie Nombr. Bordeaux 13, 609–631 (2001)
Scheidler, R., Stein, A.: Voronoi’s algorithm in purely cubic congruence function fields of unit rank 1. Math. Comp. 69, 1245–1266 (2000)
Schmidt, F.K.: Zahlentheorie in Körpern der Charakteristik p. Math. Zeitschr 33, 1–32 (1931)
Voronoi, G.F.: On a Generalization of the Algorithm of Continued Fractions. Doctoral Dissertation, Warsaw (1896) (in Russian)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scheidler, R. (2004). Algorithmic Aspects of Cubic Function Fields. In: Buell, D. (eds) Algorithmic Number Theory. ANTS 2004. Lecture Notes in Computer Science, vol 3076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24847-7_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-24847-7_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22156-2
Online ISBN: 978-3-540-24847-7
eBook Packages: Springer Book Archive