Fast algorithm of square rooting in some finite fields of odd characteristic

DOI10.3103/S0027132218050029zbMath1441.11303OpenAlexW2899969733MaRDI QIDQ1725540

I. B. Gashkov, Sergey B. Gashkov

Publication date: 14 February 2019

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

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

zbMATH Keywords

fast algorithmGalois fieldfinite fields of odd characteristiccomplexity of square root computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Finite fields and commutative rings (number-theoretic aspects) (11T99)

Related Items

Fast algorithms for solving equations of degree \(\le 4\) in some finite fields

Cites Work

• Linear ternary quasiperfect codes correcting double errors
• On the decoding of some exceptional ternary codes
• On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
• Faster Polynomial Multiplication over Finite Fields
• Batch Binary Edwards
• Fast Polynomial Factorization and Modular Composition
• Explicit Bounds for Primality Testing and Related Problems
• Faster Integer Multiplication
• On a quick multiplication in normal bases of finite fields
• Curve41417: Karatsuba Revisited
• An application of the method of additive chains to inversion in finite fields
• A note on square roots in finite fields