A comment on ``An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation'' (Q2510465)
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 6324121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comment on ``An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation'' |
scientific article; zbMATH DE number 6324121 |
Statements
A comment on ``An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation'' (English)
0 references
1 August 2014
0 references
modular arithmetic
0 references
modular exponentiation
0 references
single-precision multiplication
0 references
computational efficiency
0 references
public-key cryptography
0 references
0.9593716
0 references
0.93718123
0 references
0.86020094
0 references
0.85687137
0 references
0.85634625
0 references
0.8560989
0 references
0.85361546
0 references
