A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation. (Q2583543)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2247930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation. |
scientific article; zbMATH DE number 2247930 |
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
0.8880481719970703
0 references
0.8225664496421814
0 references
0.8037019968032837
0 references
