A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation. (Q2583543): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4036876 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585020 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Modular Multiplication Without Trial Division / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank | |||
Normal rank | |||
Latest revision as of 14:20, 11 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation. |
scientific article |
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
