Square root computation in finite fields
From MaRDI portal
Publication:6564090
DOI10.1007/S10623-024-01374-1MaRDI QIDQ6564090FDOQ6564090
Authors: Ebru Adiguzel-Goktas, Enver Ozdemir 
Publication date: 28 June 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52) Computational methods for problems pertaining to field theory (12-08)
Cites Work
- Elliptic curves. Number theory and cryptography
- Title not available (Why is that?)
- Advanced Topics in Computional Number Theory
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Explicit Bounds for Primality Testing and Related Problems
- Structure computation and discrete logarithms in finite abelian \(p\)-groups
- A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
- Title not available (Why is that?)
- Factoring polynomials over finite fields
- Un metodo per la risoluzione della congruenza di secondo grado.
- Computing Square Roots in Finite Fields
- Strong pseudoprimes to base 2
This page was built for publication: Square root computation in finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564090)
