Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:advantage |
avoids trial division
improves performance of modular exponentiation |
| gptkbp:category |
number theory
public-key cryptography |
| gptkbp:field |
cryptography
modular arithmetic |
| https://www.w3.org/2000/01/rdf-schema#label |
Montgomery multiplication
|
| gptkbp:input |
integers modulo n
|
| gptkbp:introducedIn |
1985
|
| gptkbp:inventedBy |
Peter L. Montgomery
|
| gptkbp:output |
product modulo n
|
| gptkbp:purpose |
efficient modular multiplication
|
| gptkbp:relatedTo |
modular exponentiation
Barrett reduction |
| gptkbp:requires |
precomputed Montgomery parameter
|
| gptkbp:usedIn |
gptkb:Elliptic_Curve_Cryptography
gptkb:RSA gptkb:Diffie-Hellman_key_exchange |
| gptkbp:bfsParent |
gptkb:Peter_Montgomery
|
| gptkbp:bfsLayer |
7
|