Abstract
In mathematics, automorphisms of algebraic structures play an important role. Automorphisms capture the symmetries inherent in the structures and many important results have been proved by analyzing the automorphism group of the structure. For example, Galois characterized degree five univariate polynomials f over rationals whose roots can be expressed using radicals (using addition, subtraction, multiplication, division and taking roots) via the structure of automorphism group of the splitting field of f. In computer science too, automorphisms have played a useful role in our understanding of the complexity of many algebraic problems. From a computer science perspective, perhaps the most important structure is that of finite rings. This is because a number of algebraic problems efficiently reduce to questions about automorphisms and isomorphisms of finite rings. In this paper, we collect several examples of this from the literature as well as providing some new and interesting connections.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Annals of Mathematics 160, 1–13 (2004)
Adleman, L.M., Pomerance, C., Rumely, R.S.: On distinguishing prime numbers from composite numbers. Annals of Mathematics 117, 173–206 (1983)
Carmichael, R.D.: Note on a number theory function. Bull. Amer. Math. Soc. 16, 232–238 (1910)
Canfield, E.R., Erdos, P., Granville, A.: On a problem of Oppenhein concerning “Factorisatio Numerorum”. J. Number Theory 17, 1–28 (1983)
Goldwasser, S., Kilian, J.: Almost all primes can be quickly certified. In: Proceedings of Annual ACM Symposium on the Theory of Computing, pp. 316–329 (1986)
Hensel, K.: Eine neue Theorie der algebraischen Zahlen. Mathenatische Zeitschift 2, 433–452 (1918)
Kaltofen, E.: Factorization of polynomials given by straight-line programs. In: Micali, S. (ed.) Randomness and Computation, pp. 375–412. JAI Press, Greenwich (1989)
Kayal, N., Saxena, N.: On the ring isomorphism and automorphism problems. Technical Report TR04-109, Electronic Colloquium on Computational Complexity (2004), http://www.eccc.uni-trier.de/eccc , Available at eccc.uni-trier.de/eccc-reports/2004/TR04-109/Paper.pdf
Lang, S.: Algebra. Addison-Wesley, Reading (1993)
Lenstra Jr., H.W.: Private communication
Lenstra, H.: Factoring integers with elliptic curves. Annals of Mathematics 126, 649–673 (1987)
Lenstra, A., Lenstra, H., Lovasz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261, 515–534 (1982)
Lenstra, A.K., Lenstra, H.W., Manasse, M.S., Pollard, J.M.: The number field sieve. In: Proceedings of Annual ACM Symposium on the Theory of Computing, pp. 564–572 (1990)
Lidl, R., Niederreiter, H.: Introduction to finite fields and their applications. Cambridge University Press, Cambridge (1986)
McDonald, B.R.: Finite Rings with Identity. Marcel Dekker, Inc., New York (1974)
Miller, G.L.: Riemann’s hypothesis and tests for primality. J. Comput. Sys. Sci. 13, 300–317 (1976)
Patarin, J.: Hidden field equations (HFE) and isomorphism of polynomials (IP): Two new families of assymetric algorithms. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33–48. Springer, Heidelberg (1996)
Pomerance, C.: The quadratic sieve factoring algorithm. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 169–182. Springer, Heidelberg (1985)
Rabin, M.O.: Probabilistic algorithm for testing primality. J. Number Theory 12, 128–138 (1980)
Solovay, R., Strassen, V.: A fast Monte-Carlo test for primality. SIAM Journal on Computing 6, 84–86 (1977)
Thierauf, T.: The isomorphism problem for read-once branching programs and arithmetic circuits. Chicago Journal of Theoretical Computer Science (1998)
von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agrawal, M., Saxena, N. (2005). Automorphisms of Finite Rings and Applications to Complexity of Problems. In: Diekert, V., Durand, B. (eds) STACS 2005. STACS 2005. Lecture Notes in Computer Science, vol 3404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31856-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-31856-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24998-6
Online ISBN: 978-3-540-31856-9
eBook Packages: Computer ScienceComputer Science (R0)