The inverse of an automorphism in polynomial time

DOI10.1016/S0747-7171(08)80090-9zbMath0805.13006OpenAlexW2017876328MaRDI QIDQ1190750

Matthew T. Dickerson

Publication date: 26 September 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80090-9

zbMATH Keywords

endomorphism invertibilityendomorphism of a polynomial ringinverse of an automorphism

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Parallel algorithms in computer science (68W10) Polynomials, factorization in commutative rings (13P05)

Related Items (3)

An application of algebraic geometry to encryption: tame transformation method ⋮ CRYPTANALYSIS OF AN IMPLEMENTATION SCHEME OF THE TAMED TRANSFORMATION METHOD CRYPTOSYSTEM ⋮ A public key system with signature and master key functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functional decomposition of polynomials: the tame case
• Functional decomposition of polynomials: the wild case
• Automorphisms of polynomial and power series rings
• Factoring sparse multivariate polynomials
• An inversion formula for two polynomials in two variables
• On the inversion formula for two polynomials in two variables
• Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence
• The Jacobian conjecture: Reduction of degree and formal expansion of the inverse
• New algorithms for the multidimensional discrete Fourier transform
• Fast computation of discrete Fourier transforms using polynomial transforms
• Polynomial decomposition algorithms
• Polynomial decomposition algorithms

This page was built for publication: The inverse of an automorphism in polynomial time