Automorphisms of finite rings and applications to complexity of problems

DOI10.1007/978-3-540-31856-9_1MaRDI QIDQ5710667zbMATH OpenOpenAlexFDO

Authors Nitin Saxena, Manindra Agrawal

Publication date 2 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106485

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Automorphisms of a certain class of completely primary finite rings
• Complexity of ring morphism problems
• Groups of polynomial permutations over finite commutative rings
• Lambda-rings of automorphisms
• Automorphisms of Witt rings of finite fields

Cited in

(15)

• Practical post-quantum signature schemes from isomorphism problems of trilinear forms
• Compact data structures for Dedekind groups and finite rings
• Automorphisms of a certain class of completely primary finite rings
• scientific article; zbMATH DE number 5946133 (Why is no real title available?)
• Classification problem for graphs and lattices is wild.
• scientific article; zbMATH DE number 7559443 (Why is no real title available?)
• Determinant Equivalence Test over Finite Fields and over Q
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
• Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms
• VDOO: a short, fast, post-quantum multivariate digital signature scheme
• NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
• Solving systems of algebraic equations over finite commutative rings and applications
• Testing equivalence to design polynomials
• On the complexity of isomorphism problems for tensors, groups, and polynomials. I: Tensor isomorphism-completeness
• Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms

This page was built for publication: Automorphisms of finite rings and applications to complexity of problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710667)