Fast algorithms for solving equations of degree 4 in some finite fields

DOI10.3103/S0027132221030049MaRDI QIDQ2666933zbMATH OpenOpenAlexFDO

Authors S. B. Gashkov

Publication date 23 November 2021

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s0027132221030049

zbMATH Keywords

bit complexitysolving equationsstandard and normal basestower of finite fields

Mathematics Subject Classification ID

Computational methods for problems pertaining to field theory (12-08) Finite fields (field-theoretic aspects) (12E20) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 4200329
• Solving equations in finite fields and some results concerning the structure of GF(p/sup m/)
• Deterministic equation solving over finite fields
• On arithmetical algorithms over finite fields
• Fast algorithm of square rooting in some finite fields of odd characteristic

Cites work

• A note on square roots in finite fields
• An application of the method of additive chains to inversion in finite fields
• Computing in degree \(2^k\)-extensions of finite fields of odd characteristic
• Efficient computation of roots in finite fields
• Fast algorithm of square rooting in some finite fields of odd characteristic
• Fast polynomial factorization and modular composition
• Faster integer multiplication using plain vanilla FFT primes
• Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
• Formulas for cube roots in \(\mathbb F_{3^m}\)
• Formulas for the solutions of quadratic equations over<tex>GF(2^m)</tex>(Corresp.)
• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 3150057 (Why is no real title available?)
• scientific article; zbMATH DE number 682387 (Why is no real title available?)
• scientific article; zbMATH DE number 1936673 (Why is no real title available?)
• scientific article; zbMATH DE number 918133 (Why is no real title available?)
• Hybrid methods for finding roots of a polynomial - With application to BCH decoding (Corresp.)
• On a quick multiplication in normal bases of finite fields
• On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
• On the solution of algebraic equations over finite fields
• Taking roots over high extensions of finite fields
• The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)

Cited in

(6)

• Fast algorithm for solving superelliptic equations of certain types
• The Complexity of Solving Polynomial Equations by Quadrature
• scientific article; zbMATH DE number 4200329 (Why is no real title available?)
• Detecting fast solvability of equations via small powerful Galois groups
• scientific article; zbMATH DE number 5630829 (Why is no real title available?)
• Solving equations in finite fields and some results concerning the structure of GF(p/sup m/)

This page was built for publication: Fast algorithms for solving equations of degree \(\le 4\) in some finite fields

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