A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.) (Q3806810): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:38, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.) |
scientific article |
Statements
A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.) (English)
0 references
1986
0 references
finite fields
0 references
square roots
0 references
random polynomial time algorithm
0 references
computational number theory
0 references
RP algorithms
0 references
