On taking square roots without quadratic nonresidues over finite fields
From MaRDI portal
Publication:3015058
DOI10.1090/S0025-5718-2011-02419-1zbMath1293.12008arXiv0812.2591MaRDI QIDQ3015058
Publication date: 8 July 2011
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.2591
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
On the Cipolla-Lehmer type algorithms in finite fields ⋮ Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Riemann's hypothesis and tests for primality
- PRIMES is in P
- On the computation of square roots in finite fields
- Efficient computation of roots in finite fields
- Fast multiplication of large numbers
- The least quadratic non residue
- Structure computation and discrete logarithms in finite abelian $p$-groups
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
- Probabilistic Algorithms in Finite Fields
- Square Roots mod p
- Note on taking square-roots modulo N
- Constructing nonresidues in finite fields and the extended Riemann hypothesis
- Factoring Polynomials Over Large Finite Fields
- A note on square roots in finite fields
This page was built for publication: On taking square roots without quadratic nonresidues over finite fields
