Publication:2666933

DOI10.3103/S0027132221030049zbMATH Open1481.12002OpenAlexW3201310957MaRDI QIDQ2666933FDOQ2666933

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

solving equationsbit complexitystandard and normal basestower of finite fields

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast Polynomial Factorization and Modular Composition
• On the solution of algebraic equations over finite fields
• The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
• On a quick multiplication in normal bases of finite fields
• An application of the method of additive chains to inversion in finite fields
• Taking roots over high extensions of finite fields
• Efficient computation of roots in finite fields
• On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
• Faster integer multiplication using plain vanilla FFT primes
• Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
• A note on square roots in finite fields
• Formulas for cube roots in \(\mathbb F_{3^m}\)
• Fast algorithm of square rooting in some finite fields of odd characteristic
• Formulas for the solutions of quadratic equations over<tex>GF(2^m)</tex>(Corresp.)
• Hybrid methods for finding roots of a polynomial - With application to BCH decoding (Corresp.)
• Computing in degree \(2^k\)-extensions of finite fields of odd characteristic

Cited In (3)

• Detecting fast solvability of equations via small powerful Galois groups
• Title not available (Why is that?)
• Fast algorithm for solving superelliptic equations of certain types

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)