An efficient modulo \(p\) multiplication algorithm with moderate factors of \(p+1\) and \(p-1\) (Q2470834)
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 modulo \(p\) multiplication algorithm with moderate factors of \(p+1\) and \(p-1\) |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient modulo \(p\) multiplication algorithm with moderate factors of \(p+1\) and \(p-1\) |
scientific article |
Statements
An efficient modulo \(p\) multiplication algorithm with moderate factors of \(p+1\) and \(p-1\) (English)
0 references
15 February 2008
0 references
modular multiplication
0 references
modular exponentiation
0 references
RSA cryptosystem
0 references
strong prime
0 references
