An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation (Q1007833)
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 5531263
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation |
scientific article; zbMATH DE number 5531263 |
Statements
An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation (English)
0 references
24 March 2009
0 references
modular arithmetic
0 references
exponentiation
0 references
common-multiplicand-multiplication
0 references
signed-digit recoding
0 references
public-key cryptography
0 references
complexity analysis
0 references
0 references
0 references
0.8880481719970703
0 references
0.8573010563850403
0 references
0.8330196738243103
0 references
