On the computation of square roots in finite fields
From MaRDI portal
Publication:1878298
DOI10.1023/B:DESI.0000015890.44831.e2zbMath1052.11084OpenAlexW1983120807MaRDI QIDQ1878298
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
Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items (12)
On the Cipolla-Lehmer type algorithms in finite fields ⋮ Improved generalized Atkin algorithm for computing square roots in finite fields ⋮ Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm ⋮ Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm ⋮ Efficient Finite Fields in the Maxima Computer Algebra System ⋮ Unnamed Item ⋮ On Fast Calculation of Addition Chains for Isogeny-Based Cryptography ⋮ On taking square roots without quadratic nonresidues over finite fields ⋮ Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\) ⋮ Unnamed Item ⋮ Taking roots over high extensions of finite fields ⋮ New cube root algorithm based on the third order linear recurrence relations in finite fields
Uses Software
This page was built for publication: On the computation of square roots in finite fields
