|
Volumn 4116, Issue , 2000, Pages 214-225
|
Some improvement on RNS Montgomery modular multiplication
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
DIGITAL ARITHMETIC;
INTEGER PROGRAMMING;
ITERATIVE METHODS;
MULTIPLYING CIRCUITS;
PARALLEL ALGORITHMS;
MODULAR MULTIPLICATION;
RESIDUE NUMBER SYSTEMS (RNS);
NUMBER THEORY;
|
EID: 0034511018
PISSN: 0277786X
EISSN: None
Source Type: Journal
DOI: 10.1117/12.406499 Document Type: Article |
Times cited : (2)
|
References (0)
|