Square root computation in finite fields

DOI10.1007/S10623-024-01374-1MaRDI QIDQ6564090zbMATH OpenFDO

Authors Ebru Adiguzel-Goktas, Enver Ozdemir

Publication date 28 June 2024

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

elliptic curvessingular curvessquare roots

Mathematics Subject Classification ID

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

• scientific article; zbMATH DE number 1164034 (Why is no real title available?)
• scientific article; zbMATH DE number 3353398 (Why is no real title available?)
• A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
• Advanced Topics in Computional Number Theory
• Computing Square Roots in Finite Fields
• Elliptic curves. Number theory and cryptography
• Explicit Bounds for Primality Testing and Related Problems
• Factoring polynomials over finite fields
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Strong pseudoprimes to base 2
• Structure computation and discrete logarithms in finite abelian \(p\)-groups
• Un metodo per la risoluzione della congruenza di secondo grado.

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)