On the computation of square roots in finite fields
From MaRDI portal
Publication:1878298
DOI10.1023/B:DESI.0000015890.44831.E2zbMATH Open1052.11084OpenAlexW1983120807MaRDI QIDQ1878298FDOQ1878298
Authors: Yanyan Li 
Publication date: 19 August 2004
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:desi.0000015890.44831.e2
Recommendations
- Computing Square Roots in Finite Fields
- Improved Computation of Square Roots in Specific Finite Fields
- scientific article; zbMATH DE number 7688194
- A note on square roots in finite fields
- Efficient computation of roots in finite fields
- Square Root Computation over Even Extension Fields
- scientific article; zbMATH DE number 1303185
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Fast algorithm of square rooting in some finite fields of odd characteristic
- A High-Speed Square Root Algorithm in Extension Fields
Analysis of algorithms (68W40) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)
Cited In (20)
- Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\)
- Taking roots over high extensions of finite fields
- On taking square roots without quadratic nonresidues over finite fields. With an Appendix by Lawrence C. Washington
- A note on square roots in finite fields
- New cube root algorithm based on the third order linear recurrence relations in finite fields
- Improved generalized Atkin algorithm for computing square roots in finite fields
- Title not available (Why is that?)
- On the Cipolla-Lehmer type algorithms in finite fields
- Computation and Formal Verification of SRT Quotient and Square Root Digit Selection Tables
- On the computation of \(r\)-th roots in finite fields
- On Fast Calculation of Addition Chains for Isogeny-Based Cryptography
- Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm
- Adleman-Manders-Miller root extraction method revisited
- On Repeated Squarings in Binary Fields
- Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm
- Efficient Finite Fields in the Maxima Computer Algebra System
- Title not available (Why is that?)
- A High-Speed Square Root Algorithm in Extension Fields
- Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic
- Continuity properties of projection operators
Uses Software
This page was built for publication: On the computation of square roots in finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1878298)
