Solving systems of diagonal polynomial equations over finite fields

DOI10.1016/J.TCS.2016.04.045MaRDI QIDQ507442zbMATH OpenOpenAlexFDO

Authors Gábor Ivanyos, Miklos Santha

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

algorithmChevalley-Warning theoremfinite fieldspolynomial equationsquantum computing

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Symbolic computation and algebraic computation (68W30)

Recommendations

• On solving systems of diagonal polynomial equations over finite fields
• Deterministic equation solving over finite fields
• Efficient quantum algorithm for identifying hidden polynomials
• scientific article; zbMATH DE number 5372380
• Beating brute force for systems of polynomial equations over finite fields

Cites work

• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Efficient quantum algorithm for identifying hidden polynomials
• Explicit Bounds for Primality Testing and Related Problems
• Finding conjugate stabilizer subgroups in PSL(2; q) and related groups
• Hidden symmetry subgroup problems
• Hidden translation and orbit coset in quantum computing
• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• scientific article; zbMATH DE number 3480679 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1962903 (Why is no real title available?)
• On solving systems of diagonal polynomial equations over finite fields
• On the complexity of the parity argument and other inefficient proofs of existence
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Computation and Lattice Problems
• Quantum mechanical algorithms for the nonabelian hidden subgroup problem
• Reducibility among combinatorial problems
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• The power of basis selection in Fourier sampling: hidden subgroup problems in affine groups

Cited in

(2)

• On solving systems of diagonal polynomial equations over finite fields
• Zero sum subsequences and hidden subgroups

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

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