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 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tit.1986.1057236 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024686830 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:27, 30 July 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
