On the generic complexity of the square root modulo prime problem

DOI10.17223/20710410/62/9MaRDI QIDQ6495981

Alexander N. Rybalov

Publication date: 2 May 2024

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

zbMATH Keywords

generic complexitysquare root modulo prime

Mathematics Subject Classification ID

Computer science (68-XX) Number theory (11-XX)

Cites Work

• Generic-case complexity, decision problems in group theory, and random walks.
• The least quadratic non residue
• ON GENERIC COMPLEXITY OF THE QUADRATIC RESIDUOSITY PROBLEM
• Unnamed Item
• Unnamed Item

This page was built for publication: On the generic complexity of the square root modulo prime problem