Solving systems of diagonal polynomial equations over finite fields

DOI10.1016/j.tcs.2016.04.045zbMath1356.68281OpenAlexW1807692705MaRDI QIDQ507442

Miklos Santha, Gábor Ivanyos

Publication date: 6 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.045

zbMATH Keywords

algorithmfinite fieldspolynomial equationsquantum computingChevalley-Warning theorem

Mathematics Subject Classification ID

Related Items (1)

Zero sum subsequences and hidden subgroups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of the parity argument and other inefficient proofs of existence
• An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
• Finding conjugate stabilizer subgroups in PSL(2; q) and related groups
• On Solving Systems of Diagonal Polynomial Equations Over Finite Fields
• Explicit Bounds for Primality Testing and Related Problems
• Hidden translation and orbit coset in quantum computing
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Computation and Lattice Problems
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• Reducibility among Combinatorial Problems
• Quantum mechanical algorithms for the nonabelian hidden subgroup problem
• Hidden Symmetry Subgroup Problems
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem

This page was built for publication: Solving systems of diagonal polynomial equations over finite fields