Abstract
In this paper we present our implementation of finite fields in the free and open Maxima computer algebra system. In the first version of our package we focused our efforts on efficient computation of primitive elements and modular roots. Our optimizations involve some heuristic methods that use “modular composition” and the generalized Tonelli-Shanks algorithm. Other open and free systems such as GP/Pari do not include in their standard packages any support for finite fields. The computation of the primitive element in Maxima is now faster than in Axiom. Our package provides a more user-friendly interface for teaching than other comparable systems.
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
Brickell, E., Gordon, D., McCurley, K., Wilson, D.: Fast exponentiation with precomputation. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 200–207. Springer, Heidelberg (1993)
Caruso, F., D’Aurizio, J., Mc Andrew, A.: On line manual on Finite Fields in Maxima (2007), http://www.dm.unipi.it/~caruso
Chor, B., Rivest, R.L.: A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inform. Theory 34(5, part 1) 901–909 (1988)
Cipolla, M.: Sulla risoluzione apiristica delle congruenze binomie secondo un modulo primo. Mathematische Annalen 63, 54–61 (1907)
Creutzig, C., Oevel, W.: MuPAD Tutorial, 2nd edn. Springer, Heidelberg (2004)
Daemen, J., Rijmen, V.: The design of Rijndael. In: Information Security and Cryptography. AES—the advanced encryption standard. Springer, Heidelberg (2002)
Pari Group. GP/Pari on line documentation (2003), http://pari.math.u-bordeaux.fr/
Heck, A.: Introduction to Maple, 3rd edn. Springer, Heidelberg (2003)
Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in \(\mathbb{F}_{2^m}\) using normal bases. Inform. and Comput. 78(3), 171–177 (1988)
Jenks, R.D., Sutor, R.S.: AXIOM. The scientific computation system, With a foreword by David V. Chudnovsky and Gregory V. Chudnovsky. Numerical Algorithms Group Ltd., Oxford (1992)
Lehmer, D.H.: Computer technology applied to the theory of numbers. In: Studies in Number Theory, pp. 117–151; Math. Assoc. Amer. (distributed by Prentice-Hall, Englewood Cliffs, N.J.) (1969)
McAndrew, A.: Teaching cryptography with open-source software. In: SIGCSE 2008: Proceedings of the 39th SIGCSE technical symposium on Computer science education, pp. 325–329. ACM, New York (2008)
McEliece, R.J.: Finite Fields for Computer Scientists and Engineers. Kluwer Academic Publishers, Boston (1987)
Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press Series on Discrete Mathematics and its Applications. CRC Press, Boca Raton (1997) (With a foreword by Ronald L. Rivest)
Müller, S.: On the Computation of Square Roots in Finite Fields. Designs, Codes and Cryptography 31(3), 301–312 (2004)
Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Information Theory IT-24(1), 106–110 (1978)
Rowney, K.T., Silverman, R.D.: Finite field manipulations in Macsyma. SIGSAM Bull. 23(1), 39–48 (1989)
Schelter, W.F., The Maxima Group: Maxima on line documentation (2001), http://maxima.sourceforge.net
Shanks, D.: Five Number-Theoretic Algorithms. In: Proceedings of the Second Manitoba Conference on Numerical Mathematics, pp. 51–70 (1972)
Shoup, V.: New Algorithms for Finding Irredicible Polynomials Over Finite Fields. Mathematics of Computation 54(189), 435–447 (1990)
Shoup, V.: Searching for Primitive Roots in Finite Fields. Math. Comp. 58(197), 369–380 (1992)
Stickelberger, L.: Über eine neue Eigenschaft der Diskriminanten algebraischer Zahlkörper. In: Verhandlungen des ersten Internationalen Mathematiker-Kongresses, pp. 182–193 (1897)
Tonelli, A.: Bemerkung über die Auflösung quadratischer Congruenzen. Göttingen Nachrichten, 344–346 (1891)
Wang, Y.: On the least primitive root of a prime. Sci. Sinica 10, 1–14 (1961)
Yan, S.Y.: Number Theory for Computing, 2nd edn. Springer, New York (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caruso, F., D’Aurizio, J., McAndrew, A. (2008). Efficient Finite Fields in the Maxima Computer Algebra System. In: von zur Gathen, J., Imaña, J.L., Koç, Ç.K. (eds) Arithmetic of Finite Fields. WAIFI 2008. Lecture Notes in Computer Science, vol 5130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69499-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-69499-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69498-4
Online ISBN: 978-3-540-69499-1
eBook Packages: Computer ScienceComputer Science (R0)