Deterministic equation solving over finite fields

DOI10.1145/1073884.1073932zbMath1360.11146OpenAlexW2054140003MaRDI QIDQ5262784

Christiaan van de Woestijne

Publication date: 16 July 2015

Published in: Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073884.1073932

zbMATH Keywords

finite fieldsdeterministic algorithmsequation solving

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (11)

Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\) ⋮ On Solving Systems of Diagonal Polynomial Equations Over Finite Fields ⋮ On Existence (Based on an Arithmetical Problem) and Constructions of Bent Functions ⋮ Deterministically generating Picard groups of hyperelliptic curves over finite fields ⋮ An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups ⋮ Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing ⋮ Identifying the Matrix Ring: Algorithms for Quaternion Algebras and Quadratic Forms ⋮ Noncanonical number systems in the integers ⋮ From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces ⋮ Trading GRH for algebra: Algorithms for factoring polynomials and related structures ⋮ Sequences of irreducible polynomials without prescribed coefficients over odd prime fields

This page was built for publication: Deterministic equation solving over finite fields