Deterministic equation solving over finite fields

DOI10.1145/1073884.1073932MaRDI QIDQ5262784zbMATH OpenOpenAlexFDO

Authors Christiaan E. 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

deterministic algorithmsequation solvingfinite fields

Mathematics Subject Classification ID

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

Recommendations

• Sparse algebraic equations over finite fields
• Counting solutions to equations in many variables over finite fields
• Solving sparse linear equations over finite fields
• On solving sparse algebraic equations over finite fields
• Applications of the representation of finite fields by matrices

Cited in

(16)

• Noncanonical number systems in the integers
• Applications of the representation of finite fields by matrices
• Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\)
• Counting solutions to equations in many variables over finite fields
• Sequences of irreducible polynomials without prescribed coefficients over odd prime fields
• An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
• Products with variables from low-dimensional affine spaces and shifted power identity testing in finite fields
• Fast algorithms for solving equations of degree \(\le 4\) in some finite fields
• Trading GRH for algebra: algorithms for factoring polynomials and related structures
• On solving systems of diagonal polynomial equations over finite fields
• On existence (based on an arithmetical problem) and constructions of bent functions
• Algorithms based on \(*\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
• From independent sets and vertex colorings to isotropic spaces and isotropic decompositions: another bridge between graphs and alternating matrix spaces
• Solving systems of diagonal polynomial equations over finite fields
• Identifying the matrix ring: algorithms for quaternion algebras and quadratic forms
• Deterministically generating Picard groups of hyperelliptic curves over finite fields

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

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