A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation. (Q2583543): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:06, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation. |
scientific article |
Statements
A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation. (English)
0 references
17 January 2006
0 references
Public key cryptosystem
0 references
Fast exponentiation
0 references
Modular arithmetic
0 references
Common-multiplicand multiplication
0 references
Cryptography
0 references
