A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\) (Q1606999): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Computer Algorithm for Calculating the Product AB Modulo M / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(99)00137-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964601020 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:10, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\) |
scientific article |
Statements
A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\) (English)
0 references
25 July 2002
0 references
iterative modular multiplication algorithm
0 references
RSA cryptosystems
0 references
