Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
p is an odd prime
|
| gptkbp:complexity |
O(log^2 p)
|
| gptkbp:field |
computational mathematics
number theory |
| gptkbp:firstPublished |
1973
|
| https://www.w3.org/2000/01/rdf-schema#label |
Tonelli–Shanks algorithm
|
| gptkbp:input |
prime number p
integer n |
| gptkbp:namedAfter |
Daniel Shanks
Alberto Tonelli |
| gptkbp:output |
integer x such that x^2 ≡ n mod p
|
| gptkbp:purpose |
finding square roots modulo a prime
|
| gptkbp:relatedTo |
gptkb:Legendre_symbol
gptkb:Euler's_criterion modular arithmetic quadratic residue Cipolla's algorithm |
| gptkbp:usedIn |
gptkb:elliptic_curve_cryptography
cryptography primality testing |
| gptkbp:bfsParent |
gptkb:Quadratic_residues
|
| gptkbp:bfsLayer |
7
|