An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques (Q870135)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques |
scientific article; zbMATH DE number 5132895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques |
scientific article; zbMATH DE number 5132895 |
Statements
An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques (English)
0 references
12 March 2007
0 references
Montgomery algorithm
0 references
modular exponentiation
0 references
exponent-folding technique
0 references
algorithm analysis
0 references
canonical-signed-digit recoding
0 references
0.8573010563850403
0 references
0.8369860053062439
0 references
